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/20170304-DifficultPathPrograms/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:36:47,343 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:36:47,345 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:36:47,361 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:36:47,361 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:36:47,362 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:36:47,364 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:36:47,365 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:36:47,367 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:36:47,368 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:36:47,369 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:36:47,369 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:36:47,370 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:36:47,371 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:36:47,372 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:36:47,373 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:36:47,374 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:36:47,376 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:36:47,378 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:36:47,379 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:36:47,380 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:36:47,381 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:36:47,384 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:36:47,384 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:36:47,384 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:36:47,385 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:36:47,386 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:36:47,387 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:36:47,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:36:47,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:36:47,389 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:36:47,390 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:36:47,390 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:36:47,390 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:36:47,391 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:36:47,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:36:47,392 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 [2019-02-25 15:36:47,406 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:36:47,406 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:36:47,407 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:36:47,407 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:36:47,407 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:36:47,408 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:36:47,408 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:36:47,408 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:36:47,408 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:36:47,408 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:36:47,409 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:36:47,409 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:36:47,409 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:36:47,410 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:36:47,410 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:36:47,410 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:36:47,410 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:36:47,411 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:36:47,411 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:36:47,411 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:36:47,411 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:36:47,411 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:36:47,412 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:36:47,412 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:36:47,412 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:36:47,412 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:36:47,412 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:36:47,413 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:36:47,413 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:36:47,413 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:36:47,413 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:36:47,413 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:36:47,414 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:36:47,414 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:36:47,414 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:36:47,414 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:36:47,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:36:47,415 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:36:47,415 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:36:47,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:36:47,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:36:47,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:36:47,484 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:36:47,484 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:36:47,485 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2019-02-25 15:36:47,486 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2019-02-25 15:36:47,522 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:36:47,523 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:36:47,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:36:47,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:36:47,524 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:36:47,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:36:47,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:36:47,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:36:47,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:36:47,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:36:47,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:36:47,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:36:47,581 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:36:47,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:36:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:36:47,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:36:47,844 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:36:47,844 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-25 15:36:47,846 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:36:47 BoogieIcfgContainer [2019-02-25 15:36:47,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:36:47,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:36:47,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:36:47,851 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:36:47,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/2) ... [2019-02-25 15:36:47,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b51aa52 and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:36:47, skipping insertion in model container [2019-02-25 15:36:47,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:36:47" (2/2) ... [2019-02-25 15:36:47,856 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bpl [2019-02-25 15:36:47,868 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:36:47,878 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:36:47,896 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:36:47,935 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:36:47,935 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:36:47,936 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:36:47,936 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:36:47,936 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:36:47,936 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:36:47,936 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:36:47,937 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:36:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-25 15:36:47,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:36:47,970 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:47,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:36:47,976 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:47,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:47,983 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-25 15:36:47,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:48,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:48,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:48,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:36:48,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:36:48,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:36:48,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:36:48,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:36:48,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:36:48,234 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-25 15:36:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:48,274 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-25 15:36:48,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:36:48,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:36:48,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:48,288 INFO L225 Difference]: With dead ends: 9 [2019-02-25 15:36:48,288 INFO L226 Difference]: Without dead ends: 5 [2019-02-25 15:36:48,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:36:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-25 15:36:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-25 15:36:48,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-25 15:36:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-25 15:36:48,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-25 15:36:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:48,328 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-25 15:36:48,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:36:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-25 15:36:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:36:48,328 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:48,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:36:48,329 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:48,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-02-25 15:36:48,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:48,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:48,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:48,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:48,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:48,454 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:36:48,455 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-02-25 15:36:48,511 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:36:48,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:36:49,624 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:36:49,625 INFO L272 AbstractInterpreter]: Visited 4 different actions 20 times. Merged at 1 different actions 8 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:36:49,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:49,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:36:49,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:49,633 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 [2019-02-25 15:36:49,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:49,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:49,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 15:36:49,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:49,709 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:49,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:49,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-25 15:36:49,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:49,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:36:49,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:36:49,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:36:49,964 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-02-25 15:36:50,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:50,032 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-25 15:36:50,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:36:50,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:36:50,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:50,033 INFO L225 Difference]: With dead ends: 8 [2019-02-25 15:36:50,033 INFO L226 Difference]: Without dead ends: 6 [2019-02-25 15:36:50,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:36:50,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-25 15:36:50,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-25 15:36:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-25 15:36:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-25 15:36:50,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-25 15:36:50,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:50,037 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-25 15:36:50,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:36:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-25 15:36:50,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:36:50,038 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:50,039 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-25 15:36:50,039 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:50,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:50,039 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-02-25 15:36:50,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:50,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:50,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:50,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:50,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:50,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:50,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:50,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:50,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:50,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:50,155 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 [2019-02-25 15:36:50,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:50,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:50,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:36:50,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:50,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-25 15:36:50,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:50,186 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:50,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:50,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:50,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-25 15:36:50,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:50,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:36:50,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:36:50,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:36:50,313 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-02-25 15:36:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:50,328 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-25 15:36:50,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:36:50,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-25 15:36:50,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:50,330 INFO L225 Difference]: With dead ends: 9 [2019-02-25 15:36:50,330 INFO L226 Difference]: Without dead ends: 7 [2019-02-25 15:36:50,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:36:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-25 15:36:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-25 15:36:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-25 15:36:50,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-25 15:36:50,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-25 15:36:50,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:50,334 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-25 15:36:50,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:36:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-25 15:36:50,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:36:50,335 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:50,335 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-25 15:36:50,335 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:50,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:50,336 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-02-25 15:36:50,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:50,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:50,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:50,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:50,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:50,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:50,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:50,645 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:50,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:50,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:50,645 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 [2019-02-25 15:36:50,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:50,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:50,704 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:50,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:50,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-25 15:36:50,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:50,710 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:51,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:51,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-25 15:36:51,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:51,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:36:51,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:36:51,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:36:51,129 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-02-25 15:36:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:51,149 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-25 15:36:51,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:36:51,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-25 15:36:51,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:51,151 INFO L225 Difference]: With dead ends: 10 [2019-02-25 15:36:51,151 INFO L226 Difference]: Without dead ends: 8 [2019-02-25 15:36:51,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:36:51,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-25 15:36:51,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-25 15:36:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-25 15:36:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-25 15:36:51,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-25 15:36:51,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:51,154 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-25 15:36:51,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:36:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-25 15:36:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:36:51,155 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:51,155 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-25 15:36:51,155 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:51,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:51,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-02-25 15:36:51,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:51,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:51,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:51,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:51,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:51,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:51,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:51,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:51,334 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:51,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:51,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:51,335 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 [2019-02-25 15:36:51,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:51,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:51,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-25 15:36:51,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:51,366 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:51,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:51,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-25 15:36:51,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:51,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:36:51,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:36:51,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:36:51,539 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-02-25 15:36:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:51,624 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-25 15:36:51,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:36:51,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-25 15:36:51,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:51,626 INFO L225 Difference]: With dead ends: 11 [2019-02-25 15:36:51,626 INFO L226 Difference]: Without dead ends: 9 [2019-02-25 15:36:51,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:36:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-25 15:36:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-25 15:36:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-25 15:36:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-25 15:36:51,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-02-25 15:36:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:51,629 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-25 15:36:51,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:36:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-25 15:36:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:36:51,630 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:51,630 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-02-25 15:36:51,630 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:51,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:51,631 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-02-25 15:36:51,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:51,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:51,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:51,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:51,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:51,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:51,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:51,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:51,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:51,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:51,760 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 [2019-02-25 15:36:51,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:51,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:51,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 15:36:51,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:51,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:36:51,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:51,798 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:51,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:51,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-25 15:36:51,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:51,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:36:51,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:36:51,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:36:51,953 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-02-25 15:36:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:51,991 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-25 15:36:51,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:36:51,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-02-25 15:36:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:51,992 INFO L225 Difference]: With dead ends: 12 [2019-02-25 15:36:51,993 INFO L226 Difference]: Without dead ends: 10 [2019-02-25 15:36:51,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:36:51,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-25 15:36:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-25 15:36:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-25 15:36:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-25 15:36:51,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-02-25 15:36:51,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:51,996 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-25 15:36:51,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:36:51,996 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-25 15:36:51,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:36:51,996 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:51,996 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-02-25 15:36:51,997 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:51,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:51,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-02-25 15:36:51,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:51,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:51,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:51,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:51,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:52,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:52,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:52,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:52,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:52,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:52,435 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 [2019-02-25 15:36:52,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:52,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:52,458 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:52,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:52,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:36:52,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:52,467 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:52,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:52,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:52,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-25 15:36:52,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:52,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:36:52,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:36:52,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:36:52,744 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-02-25 15:36:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:52,770 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-02-25 15:36:52,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:36:52,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-25 15:36:52,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:52,772 INFO L225 Difference]: With dead ends: 13 [2019-02-25 15:36:52,772 INFO L226 Difference]: Without dead ends: 11 [2019-02-25 15:36:52,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:36:52,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-25 15:36:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-25 15:36:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-25 15:36:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-25 15:36:52,776 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-02-25 15:36:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:52,776 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-25 15:36:52,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:36:52,777 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-25 15:36:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-25 15:36:52,777 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:52,777 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-02-25 15:36:52,778 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:52,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:52,778 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-02-25 15:36:52,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:52,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:52,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:52,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:52,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:52,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:52,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:52,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:52,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:52,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:52,903 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 [2019-02-25 15:36:52,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:52,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:52,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:36:52,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:52,943 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:53,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:53,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-25 15:36:53,271 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:53,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:36:53,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:36:53,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:36:53,272 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-02-25 15:36:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:53,302 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-25 15:36:53,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:36:53,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-02-25 15:36:53,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:53,304 INFO L225 Difference]: With dead ends: 14 [2019-02-25 15:36:53,304 INFO L226 Difference]: Without dead ends: 12 [2019-02-25 15:36:53,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:36:53,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-25 15:36:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-25 15:36:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-25 15:36:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-25 15:36:53,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-02-25 15:36:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:53,309 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-25 15:36:53,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:36:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-25 15:36:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-25 15:36:53,310 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:53,310 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-02-25 15:36:53,310 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:53,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:53,311 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-02-25 15:36:53,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:53,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:53,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:53,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:53,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:53,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:53,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:53,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:53,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:53,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:53,433 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 [2019-02-25 15:36:53,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:53,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:53,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-25 15:36:53,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:53,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:36:53,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:53,470 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:53,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:53,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-25 15:36:53,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:53,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:36:53,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:36:53,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:36:53,948 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-02-25 15:36:53,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:53,968 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-25 15:36:53,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:36:53,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-02-25 15:36:53,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:53,970 INFO L225 Difference]: With dead ends: 15 [2019-02-25 15:36:53,970 INFO L226 Difference]: Without dead ends: 13 [2019-02-25 15:36:53,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:36:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-25 15:36:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-25 15:36:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:36:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-25 15:36:53,974 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-02-25 15:36:53,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:53,974 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-25 15:36:53,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:36:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-25 15:36:53,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-25 15:36:53,975 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:53,975 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-02-25 15:36:53,975 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:53,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:53,976 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-02-25 15:36:53,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:53,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:53,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:53,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:53,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:54,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:54,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:54,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:54,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,076 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 [2019-02-25 15:36:54,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:54,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:54,124 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:54,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:54,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:36:54,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:54,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:54,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:54,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-25 15:36:54,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:54,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:36:54,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:36:54,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:36:54,351 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-02-25 15:36:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:54,378 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-02-25 15:36:54,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:36:54,378 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-02-25 15:36:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:54,378 INFO L225 Difference]: With dead ends: 16 [2019-02-25 15:36:54,379 INFO L226 Difference]: Without dead ends: 14 [2019-02-25 15:36:54,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:36:54,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-25 15:36:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-02-25 15:36:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-25 15:36:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-02-25 15:36:54,383 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-02-25 15:36:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:54,383 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-02-25 15:36:54,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:36:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-02-25 15:36:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-25 15:36:54,384 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:54,384 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-02-25 15:36:54,384 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:54,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:54,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-02-25 15:36:54,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:54,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:54,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:54,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:54,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:54,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:54,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,513 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 [2019-02-25 15:36:54,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:54,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:54,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:36:54,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:54,540 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:55,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:55,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-25 15:36:55,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:55,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:36:55,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:36:55,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:36:55,007 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-02-25 15:36:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:55,084 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-02-25 15:36:55,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-25 15:36:55,084 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-02-25 15:36:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:55,085 INFO L225 Difference]: With dead ends: 17 [2019-02-25 15:36:55,085 INFO L226 Difference]: Without dead ends: 15 [2019-02-25 15:36:55,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:36:55,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-25 15:36:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-25 15:36:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-25 15:36:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-02-25 15:36:55,089 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-02-25 15:36:55,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:55,090 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-02-25 15:36:55,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:36:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-02-25 15:36:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-25 15:36:55,090 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:55,091 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-02-25 15:36:55,091 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:55,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:55,091 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-02-25 15:36:55,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:55,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:55,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:55,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:55,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:55,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:55,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:55,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:55,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:55,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:55,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 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 [2019-02-25 15:36:55,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:55,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:55,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-25 15:36:55,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:55,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:36:55,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:55,464 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:55,465 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:55,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:55,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-25 15:36:55,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:55,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:36:55,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:36:55,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:36:55,827 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-02-25 15:36:55,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:55,864 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-25 15:36:55,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-25 15:36:55,865 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-02-25 15:36:55,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:55,865 INFO L225 Difference]: With dead ends: 18 [2019-02-25 15:36:55,865 INFO L226 Difference]: Without dead ends: 16 [2019-02-25 15:36:55,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:36:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-25 15:36:55,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-02-25 15:36:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-25 15:36:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-25 15:36:55,869 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-02-25 15:36:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:55,870 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-25 15:36:55,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:36:55,870 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-25 15:36:55,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-25 15:36:55,870 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:55,870 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-02-25 15:36:55,871 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:55,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:55,871 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-02-25 15:36:55,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:55,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:55,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:55,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:55,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:56,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:56,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:56,048 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:56,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:56,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:56,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 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 [2019-02-25 15:36:56,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:56,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:56,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:56,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:56,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:36:56,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:56,075 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:56,075 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:56,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:56,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-25 15:36:56,316 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:56,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-25 15:36:56,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-25 15:36:56,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-25 15:36:56,317 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-02-25 15:36:56,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:56,358 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-02-25 15:36:56,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-25 15:36:56,358 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-02-25 15:36:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:56,359 INFO L225 Difference]: With dead ends: 19 [2019-02-25 15:36:56,359 INFO L226 Difference]: Without dead ends: 17 [2019-02-25 15:36:56,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-25 15:36:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-25 15:36:56,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-25 15:36:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:36:56,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-25 15:36:56,363 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-02-25 15:36:56,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:56,363 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-25 15:36:56,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-25 15:36:56,364 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-25 15:36:56,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-25 15:36:56,364 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:56,364 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-02-25 15:36:56,364 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:56,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:56,365 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-02-25 15:36:56,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:56,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:56,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:56,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:56,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:56,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:56,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:56,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:56,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:56,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:56,552 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 [2019-02-25 15:36:56,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:56,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:56,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:36:56,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:56,589 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:56,590 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:56,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:56,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-25 15:36:56,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:56,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-25 15:36:56,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-25 15:36:56,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:36:56,982 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-02-25 15:36:57,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:57,020 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-25 15:36:57,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-25 15:36:57,027 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-02-25 15:36:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:57,028 INFO L225 Difference]: With dead ends: 20 [2019-02-25 15:36:57,028 INFO L226 Difference]: Without dead ends: 18 [2019-02-25 15:36:57,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:36:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-25 15:36:57,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-02-25 15:36:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-25 15:36:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-02-25 15:36:57,035 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-02-25 15:36:57,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:57,036 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-02-25 15:36:57,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-25 15:36:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-02-25 15:36:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-02-25 15:36:57,037 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:57,037 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-02-25 15:36:57,037 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:57,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-02-25 15:36:57,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:57,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:57,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:57,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:57,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:57,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:57,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:57,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:57,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:57,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:57,295 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 [2019-02-25 15:36:57,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:57,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:57,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-25 15:36:57,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:57,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:36:57,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:57,441 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:58,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:58,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-25 15:36:58,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:58,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-25 15:36:58,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-25 15:36:58,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:36:58,048 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-02-25 15:36:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:58,087 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-02-25 15:36:58,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-25 15:36:58,088 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-02-25 15:36:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:58,089 INFO L225 Difference]: With dead ends: 21 [2019-02-25 15:36:58,089 INFO L226 Difference]: Without dead ends: 19 [2019-02-25 15:36:58,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:36:58,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-25 15:36:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-25 15:36:58,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-25 15:36:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-02-25 15:36:58,094 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-02-25 15:36:58,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:58,095 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-02-25 15:36:58,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-25 15:36:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-02-25 15:36:58,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-25 15:36:58,096 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:58,096 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-02-25 15:36:58,096 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:58,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:58,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-02-25 15:36:58,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:58,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:58,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:58,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:58,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:58,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:58,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:58,342 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:58,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:58,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:58,342 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 [2019-02-25 15:36:58,351 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:58,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:58,365 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:58,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:58,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:36:58,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:58,373 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:58,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:58,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-25 15:36:58,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:58,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-25 15:36:58,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-25 15:36:58,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:36:58,828 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-02-25 15:36:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:58,864 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-02-25 15:36:58,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-25 15:36:58,864 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-02-25 15:36:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:58,865 INFO L225 Difference]: With dead ends: 22 [2019-02-25 15:36:58,866 INFO L226 Difference]: Without dead ends: 20 [2019-02-25 15:36:58,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:36:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-25 15:36:58,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-02-25 15:36:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-25 15:36:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-02-25 15:36:58,871 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-02-25 15:36:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:58,872 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-02-25 15:36:58,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-25 15:36:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-02-25 15:36:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-25 15:36:58,872 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:58,873 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-02-25 15:36:58,873 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:58,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:58,873 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-02-25 15:36:58,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:58,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:58,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:58,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:58,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:59,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:59,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:59,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:59,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:59,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:59,500 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 [2019-02-25 15:36:59,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:59,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:59,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:36:59,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:59,541 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:00,191 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:00,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:00,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-25 15:37:00,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:00,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-25 15:37:00,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-25 15:37:00,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-25 15:37:00,212 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-02-25 15:37:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:00,264 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-02-25 15:37:00,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-25 15:37:00,266 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-02-25 15:37:00,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:00,267 INFO L225 Difference]: With dead ends: 23 [2019-02-25 15:37:00,267 INFO L226 Difference]: Without dead ends: 21 [2019-02-25 15:37:00,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-25 15:37:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-25 15:37:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-25 15:37:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-25 15:37:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-25 15:37:00,270 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-02-25 15:37:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:00,270 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-25 15:37:00,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-25 15:37:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-25 15:37:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-25 15:37:00,271 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:00,271 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-02-25 15:37:00,272 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:00,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:00,272 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-02-25 15:37:00,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:00,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:00,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:00,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:00,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:00,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:00,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:00,484 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:00,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:00,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:00,484 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 [2019-02-25 15:37:00,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:00,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:00,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-25 15:37:00,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:00,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:37:00,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:00,524 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:01,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:01,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-25 15:37:01,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:01,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-25 15:37:01,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-25 15:37:01,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:37:01,294 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-02-25 15:37:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:01,321 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-25 15:37:01,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-25 15:37:01,322 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-02-25 15:37:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:01,323 INFO L225 Difference]: With dead ends: 24 [2019-02-25 15:37:01,323 INFO L226 Difference]: Without dead ends: 22 [2019-02-25 15:37:01,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:37:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-25 15:37:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-02-25 15:37:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-25 15:37:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-25 15:37:01,328 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-02-25 15:37:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:01,328 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-25 15:37:01,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-25 15:37:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-25 15:37:01,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-25 15:37:01,329 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:01,329 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-02-25 15:37:01,330 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:01,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:01,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-02-25 15:37:01,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:01,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:01,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:01,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:01,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:02,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:02,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:02,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:02,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:02,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:02,112 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 [2019-02-25 15:37:02,122 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:02,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:02,156 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:02,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:02,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:37:02,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:02,169 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:02,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:02,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-25 15:37:02,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:02,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-25 15:37:02,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-25 15:37:02,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:37:02,611 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-02-25 15:37:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:02,747 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-02-25 15:37:02,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-25 15:37:02,747 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-02-25 15:37:02,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:02,748 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:37:02,748 INFO L226 Difference]: Without dead ends: 23 [2019-02-25 15:37:02,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:37:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-25 15:37:02,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-25 15:37:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:37:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-02-25 15:37:02,753 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-02-25 15:37:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:02,754 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-02-25 15:37:02,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-25 15:37:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-02-25 15:37:02,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-25 15:37:02,754 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:02,755 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-02-25 15:37:02,755 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:02,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:02,755 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-02-25 15:37:02,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:02,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:02,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:02,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:02,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:03,129 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:03,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:03,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:03,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:03,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:03,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:03,130 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 [2019-02-25 15:37:03,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:03,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:03,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:37:03,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:03,165 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:03,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:03,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-25 15:37:03,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:03,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-25 15:37:03,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-25 15:37:03,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-25 15:37:03,638 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-02-25 15:37:03,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:03,719 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-25 15:37:03,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-25 15:37:03,720 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-02-25 15:37:03,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:03,721 INFO L225 Difference]: With dead ends: 26 [2019-02-25 15:37:03,721 INFO L226 Difference]: Without dead ends: 24 [2019-02-25 15:37:03,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-25 15:37:03,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-25 15:37:03,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-02-25 15:37:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-25 15:37:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-02-25 15:37:03,726 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-02-25 15:37:03,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:03,726 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-02-25 15:37:03,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-25 15:37:03,726 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-02-25 15:37:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-25 15:37:03,727 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:03,727 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-02-25 15:37:03,727 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:03,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:03,727 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-02-25 15:37:03,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:03,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:03,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:03,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:03,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:03,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:04,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:04,000 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:04,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:04,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:04,001 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 [2019-02-25 15:37:04,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:04,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:04,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-25 15:37:04,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:04,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:37:04,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:04,048 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:04,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:04,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-25 15:37:04,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:04,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-25 15:37:04,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-25 15:37:04,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:37:04,578 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-02-25 15:37:04,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:04,618 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-25 15:37:04,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-25 15:37:04,626 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-02-25 15:37:04,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:04,627 INFO L225 Difference]: With dead ends: 27 [2019-02-25 15:37:04,627 INFO L226 Difference]: Without dead ends: 25 [2019-02-25 15:37:04,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:37:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-25 15:37:04,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-25 15:37:04,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:37:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-25 15:37:04,632 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-02-25 15:37:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:04,632 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-25 15:37:04,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-25 15:37:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-25 15:37:04,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-25 15:37:04,633 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:04,633 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-02-25 15:37:04,633 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:04,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:04,634 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-02-25 15:37:04,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:04,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:04,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:04,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:04,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:04,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:04,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:04,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:04,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:04,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:04,897 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 [2019-02-25 15:37:04,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:04,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:04,926 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:04,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:04,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 23 conjunts are in the unsatisfiable core [2019-02-25 15:37:04,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:04,935 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:05,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:05,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-25 15:37:05,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:05,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-25 15:37:05,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-25 15:37:05,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-25 15:37:05,772 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-02-25 15:37:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:05,869 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-02-25 15:37:05,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-25 15:37:05,872 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-02-25 15:37:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:05,873 INFO L225 Difference]: With dead ends: 28 [2019-02-25 15:37:05,873 INFO L226 Difference]: Without dead ends: 26 [2019-02-25 15:37:05,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-25 15:37:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-25 15:37:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-02-25 15:37:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-25 15:37:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-25 15:37:05,877 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-02-25 15:37:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:05,877 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-25 15:37:05,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-25 15:37:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-25 15:37:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-25 15:37:05,878 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:05,878 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-02-25 15:37:05,878 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:05,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:05,878 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-02-25 15:37:05,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:05,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:05,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:05,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:05,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:07,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:07,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:07,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:07,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:07,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:07,043 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 [2019-02-25 15:37:07,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:07,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:07,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 24 conjunts are in the unsatisfiable core [2019-02-25 15:37:07,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:07,077 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:07,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:07,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-25 15:37:07,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:07,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-25 15:37:07,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-25 15:37:07,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-25 15:37:07,683 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-02-25 15:37:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:07,722 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-02-25 15:37:07,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-25 15:37:07,723 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-02-25 15:37:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:07,723 INFO L225 Difference]: With dead ends: 29 [2019-02-25 15:37:07,723 INFO L226 Difference]: Without dead ends: 27 [2019-02-25 15:37:07,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-25 15:37:07,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-25 15:37:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-25 15:37:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-25 15:37:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-02-25 15:37:07,728 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-02-25 15:37:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:07,729 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-02-25 15:37:07,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-25 15:37:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-02-25 15:37:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-25 15:37:07,729 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:07,729 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-02-25 15:37:07,730 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:07,730 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-02-25 15:37:07,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:07,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:07,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:07,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:07,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:08,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:08,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:08,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:08,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:08,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:08,380 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 [2019-02-25 15:37:08,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:08,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:08,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-25 15:37:08,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:08,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-25 15:37:08,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:08,433 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:09,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:09,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-25 15:37:09,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:09,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-25 15:37:09,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-25 15:37:09,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:37:09,136 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-02-25 15:37:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:09,226 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-25 15:37:09,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-25 15:37:09,227 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-02-25 15:37:09,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:09,227 INFO L225 Difference]: With dead ends: 30 [2019-02-25 15:37:09,228 INFO L226 Difference]: Without dead ends: 28 [2019-02-25 15:37:09,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:37:09,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-25 15:37:09,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-02-25 15:37:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-25 15:37:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-25 15:37:09,233 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-02-25 15:37:09,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:09,233 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-25 15:37:09,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-25 15:37:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-25 15:37:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-25 15:37:09,234 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:09,234 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-02-25 15:37:09,234 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:09,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:09,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-02-25 15:37:09,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:09,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:09,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:09,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:09,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:09,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:09,684 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:09,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:09,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:09,684 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 [2019-02-25 15:37:09,694 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:09,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:09,710 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:09,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:09,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-25 15:37:09,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:09,720 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:10,508 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:10,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:10,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-25 15:37:10,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:10,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-25 15:37:10,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-25 15:37:10,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-25 15:37:10,530 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-02-25 15:37:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:10,584 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-25 15:37:10,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-25 15:37:10,584 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-02-25 15:37:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:10,585 INFO L225 Difference]: With dead ends: 31 [2019-02-25 15:37:10,585 INFO L226 Difference]: Without dead ends: 29 [2019-02-25 15:37:10,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-25 15:37:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-25 15:37:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-25 15:37:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:37:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-02-25 15:37:10,591 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-02-25 15:37:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:10,591 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-02-25 15:37:10,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-25 15:37:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-02-25 15:37:10,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-25 15:37:10,592 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:10,592 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-02-25 15:37:10,592 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:10,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-02-25 15:37:10,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:10,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:10,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:10,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:11,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:11,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:11,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:11,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:11,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:11,273 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 [2019-02-25 15:37:11,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:11,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:11,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-25 15:37:11,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:11,310 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:12,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:12,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-25 15:37:12,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:12,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-25 15:37:12,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-25 15:37:12,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-25 15:37:12,577 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-02-25 15:37:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:12,646 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-02-25 15:37:12,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-25 15:37:12,647 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-02-25 15:37:12,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:12,647 INFO L225 Difference]: With dead ends: 32 [2019-02-25 15:37:12,647 INFO L226 Difference]: Without dead ends: 30 [2019-02-25 15:37:12,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-25 15:37:12,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-25 15:37:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-02-25 15:37:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-25 15:37:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-02-25 15:37:12,652 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-02-25 15:37:12,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:12,653 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-02-25 15:37:12,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-25 15:37:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-02-25 15:37:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-02-25 15:37:12,654 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:12,654 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-02-25 15:37:12,654 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:12,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:12,654 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-02-25 15:37:12,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:12,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:12,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:12,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:12,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:13,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:13,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:13,343 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:13,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:13,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:13,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 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 [2019-02-25 15:37:13,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:13,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:13,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-25 15:37:13,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:13,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-25 15:37:13,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:13,417 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:14,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:14,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-25 15:37:14,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:14,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-25 15:37:14,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-25 15:37:14,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:37:14,327 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-02-25 15:37:14,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:14,565 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-02-25 15:37:14,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-25 15:37:14,565 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-02-25 15:37:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:14,566 INFO L225 Difference]: With dead ends: 33 [2019-02-25 15:37:14,566 INFO L226 Difference]: Without dead ends: 31 [2019-02-25 15:37:14,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:37:14,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-25 15:37:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-25 15:37:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:37:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-02-25 15:37:14,572 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-02-25 15:37:14,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:14,572 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-02-25 15:37:14,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-25 15:37:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-02-25 15:37:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-25 15:37:14,573 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:14,573 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-02-25 15:37:14,573 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:14,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:14,574 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-02-25 15:37:14,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:14,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:14,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:14,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:14,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:15,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:15,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:15,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:15,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:15,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:15,853 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 [2019-02-25 15:37:15,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:15,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:15,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:15,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:15,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-25 15:37:15,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:15,904 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:16,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:16,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-25 15:37:16,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:16,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-25 15:37:16,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-25 15:37:16,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:37:16,881 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-02-25 15:37:16,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:16,914 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-02-25 15:37:16,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-25 15:37:16,915 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-02-25 15:37:16,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:16,915 INFO L225 Difference]: With dead ends: 34 [2019-02-25 15:37:16,915 INFO L226 Difference]: Without dead ends: 32 [2019-02-25 15:37:16,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:37:16,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-25 15:37:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-02-25 15:37:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-25 15:37:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-25 15:37:16,921 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-02-25 15:37:16,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:16,921 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-25 15:37:16,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-25 15:37:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-25 15:37:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-25 15:37:16,922 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:16,922 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-02-25 15:37:16,922 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:16,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:16,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-02-25 15:37:16,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:16,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:16,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:16,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:16,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:17,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:17,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:17,363 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:17,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:17,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:17,363 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 [2019-02-25 15:37:17,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:17,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:17,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-25 15:37:17,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:17,403 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:18,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:18,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-25 15:37:18,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:18,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-25 15:37:18,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-25 15:37:18,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-25 15:37:18,778 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-02-25 15:37:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:18,853 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-25 15:37:18,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-25 15:37:18,854 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-02-25 15:37:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:18,854 INFO L225 Difference]: With dead ends: 35 [2019-02-25 15:37:18,855 INFO L226 Difference]: Without dead ends: 33 [2019-02-25 15:37:18,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-25 15:37:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-25 15:37:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-25 15:37:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-25 15:37:18,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-02-25 15:37:18,859 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-02-25 15:37:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:18,860 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-02-25 15:37:18,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-25 15:37:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-02-25 15:37:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-25 15:37:18,860 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:18,860 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-02-25 15:37:18,861 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:18,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:18,861 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-02-25 15:37:18,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:18,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:18,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:18,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:18,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:19,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:19,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:19,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:19,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:19,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:19,310 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 [2019-02-25 15:37:19,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:19,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:19,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-25 15:37:19,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:19,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-25 15:37:19,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:19,384 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:20,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:20,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-25 15:37:20,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:20,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-25 15:37:20,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-25 15:37:20,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:37:20,548 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-02-25 15:37:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:20,609 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-25 15:37:20,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-25 15:37:20,610 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-02-25 15:37:20,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:20,611 INFO L225 Difference]: With dead ends: 36 [2019-02-25 15:37:20,611 INFO L226 Difference]: Without dead ends: 34 [2019-02-25 15:37:20,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:37:20,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-25 15:37:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-02-25 15:37:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-25 15:37:20,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-25 15:37:20,616 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-02-25 15:37:20,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:20,616 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-25 15:37:20,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-25 15:37:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-25 15:37:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-25 15:37:20,617 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:20,617 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-02-25 15:37:20,617 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:20,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:20,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-02-25 15:37:20,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:20,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:20,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:20,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:20,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:21,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:21,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:21,298 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:21,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:21,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:21,299 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 [2019-02-25 15:37:21,311 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:21,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:21,334 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:21,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:21,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-25 15:37:21,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:21,346 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:22,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:22,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-25 15:37:22,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:22,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-25 15:37:22,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-25 15:37:22,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:37:22,396 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-02-25 15:37:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:22,479 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-02-25 15:37:22,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-25 15:37:22,479 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-02-25 15:37:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:22,480 INFO L225 Difference]: With dead ends: 37 [2019-02-25 15:37:22,480 INFO L226 Difference]: Without dead ends: 35 [2019-02-25 15:37:22,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:37:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-25 15:37:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-25 15:37:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-25 15:37:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-02-25 15:37:22,485 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-02-25 15:37:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:22,485 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-02-25 15:37:22,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-25 15:37:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-02-25 15:37:22,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-25 15:37:22,485 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:22,486 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-02-25 15:37:22,486 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:22,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:22,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-02-25 15:37:22,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:22,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:22,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:22,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:22,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:22,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:22,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:22,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:22,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:22,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:22,937 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 [2019-02-25 15:37:22,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:22,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:22,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-25 15:37:22,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:22,984 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:24,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:24,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-25 15:37:24,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:24,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-25 15:37:24,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-25 15:37:24,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-25 15:37:24,415 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-02-25 15:37:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:24,486 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-02-25 15:37:24,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-25 15:37:24,486 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-02-25 15:37:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:24,487 INFO L225 Difference]: With dead ends: 38 [2019-02-25 15:37:24,487 INFO L226 Difference]: Without dead ends: 36 [2019-02-25 15:37:24,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-25 15:37:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-25 15:37:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-02-25 15:37:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-25 15:37:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-25 15:37:24,490 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-02-25 15:37:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:24,490 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-25 15:37:24,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-25 15:37:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-25 15:37:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-25 15:37:24,491 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:24,491 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-02-25 15:37:24,491 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:24,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:24,492 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-02-25 15:37:24,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:24,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:24,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:24,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:24,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:25,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:25,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:25,002 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:25,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:25,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:25,002 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 [2019-02-25 15:37:25,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:25,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:25,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-25 15:37:25,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:25,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-25 15:37:25,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:25,084 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:26,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:26,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-25 15:37:26,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:26,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-25 15:37:26,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-25 15:37:26,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:37:26,325 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-02-25 15:37:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:26,393 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-25 15:37:26,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-25 15:37:26,394 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-02-25 15:37:26,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:26,394 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:37:26,394 INFO L226 Difference]: Without dead ends: 37 [2019-02-25 15:37:26,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:37:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-25 15:37:26,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-25 15:37:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-25 15:37:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-25 15:37:26,399 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-02-25 15:37:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:26,399 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-25 15:37:26,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-25 15:37:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-25 15:37:26,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-25 15:37:26,400 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:26,400 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-02-25 15:37:26,400 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:26,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:26,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-02-25 15:37:26,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:26,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:26,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:26,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:26,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:26,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:26,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:26,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:26,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:26,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:26,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 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 [2019-02-25 15:37:26,928 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:26,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:26,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:26,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:26,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-25 15:37:26,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:26,962 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:28,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:28,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-25 15:37:28,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:28,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-25 15:37:28,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-25 15:37:28,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:37:28,289 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-02-25 15:37:28,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:28,403 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-25 15:37:28,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-25 15:37:28,403 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-02-25 15:37:28,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:28,404 INFO L225 Difference]: With dead ends: 40 [2019-02-25 15:37:28,404 INFO L226 Difference]: Without dead ends: 38 [2019-02-25 15:37:28,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:37:28,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-25 15:37:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-02-25 15:37:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-25 15:37:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-02-25 15:37:28,406 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-02-25 15:37:28,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:28,407 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-02-25 15:37:28,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-25 15:37:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-02-25 15:37:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-25 15:37:28,407 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:28,408 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-02-25 15:37:28,408 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:28,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:28,408 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-02-25 15:37:28,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:28,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:28,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:28,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:28,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:28,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:28,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:28,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:28,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:28,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:28,991 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 [2019-02-25 15:37:29,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:29,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:29,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-25 15:37:29,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:29,048 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:30,404 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:30,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:30,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-25 15:37:30,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:30,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-25 15:37:30,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-25 15:37:30,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-25 15:37:30,425 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-02-25 15:37:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:30,494 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-02-25 15:37:30,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-25 15:37:30,495 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-02-25 15:37:30,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:30,495 INFO L225 Difference]: With dead ends: 41 [2019-02-25 15:37:30,496 INFO L226 Difference]: Without dead ends: 39 [2019-02-25 15:37:30,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-25 15:37:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-25 15:37:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-25 15:37:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-25 15:37:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-02-25 15:37:30,500 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-02-25 15:37:30,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:30,500 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-02-25 15:37:30,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-25 15:37:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-02-25 15:37:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-25 15:37:30,501 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:30,501 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-02-25 15:37:30,501 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:30,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:30,501 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-02-25 15:37:30,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:30,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:30,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:30,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:30,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:31,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:31,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:31,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:31,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:31,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:31,090 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 [2019-02-25 15:37:31,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:31,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:31,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-25 15:37:31,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:31,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-25 15:37:31,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:31,187 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:32,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:32,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-25 15:37:32,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:32,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-25 15:37:32,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-25 15:37:32,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:37:32,634 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-02-25 15:37:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:32,684 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-25 15:37:32,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-25 15:37:32,684 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-02-25 15:37:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:32,685 INFO L225 Difference]: With dead ends: 42 [2019-02-25 15:37:32,685 INFO L226 Difference]: Without dead ends: 40 [2019-02-25 15:37:32,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:37:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-25 15:37:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-02-25 15:37:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-25 15:37:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-25 15:37:32,688 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-02-25 15:37:32,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:32,688 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-25 15:37:32,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-25 15:37:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-25 15:37:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-25 15:37:32,689 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:32,689 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-02-25 15:37:32,689 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-02-25 15:37:32,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:32,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:32,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:33,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:33,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:33,588 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:33,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:33,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:33,588 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 [2019-02-25 15:37:33,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:33,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:33,626 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:33,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:33,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-25 15:37:33,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:33,635 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:35,214 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:35,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:35,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-25 15:37:35,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:35,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-25 15:37:35,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-25 15:37:35,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-25 15:37:35,234 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-02-25 15:37:35,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:35,292 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-02-25 15:37:35,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-25 15:37:35,292 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-02-25 15:37:35,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:35,293 INFO L225 Difference]: With dead ends: 43 [2019-02-25 15:37:35,293 INFO L226 Difference]: Without dead ends: 41 [2019-02-25 15:37:35,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-25 15:37:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-25 15:37:35,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-25 15:37:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:37:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-25 15:37:35,296 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-02-25 15:37:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:35,296 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-25 15:37:35,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-25 15:37:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-25 15:37:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-25 15:37:35,297 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:35,297 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-02-25 15:37:35,297 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:35,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:35,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-02-25 15:37:35,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:35,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:35,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:35,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:35,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:36,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:36,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:36,989 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:36,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:36,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:36,989 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 [2019-02-25 15:37:36,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:36,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:37,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-25 15:37:37,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:37,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:38,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:38,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-25 15:37:38,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:38,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-25 15:37:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-25 15:37:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:37:38,893 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-02-25 15:37:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:38,961 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-02-25 15:37:38,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-25 15:37:38,961 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-02-25 15:37:38,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:38,962 INFO L225 Difference]: With dead ends: 44 [2019-02-25 15:37:38,962 INFO L226 Difference]: Without dead ends: 42 [2019-02-25 15:37:38,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:37:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-25 15:37:38,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-02-25 15:37:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-25 15:37:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-25 15:37:38,965 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-02-25 15:37:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:38,966 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-25 15:37:38,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-25 15:37:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-25 15:37:38,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-25 15:37:38,967 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:38,967 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-02-25 15:37:38,967 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:38,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:38,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-02-25 15:37:38,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:38,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:38,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:38,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:38,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:39,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:39,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:39,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:39,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:39,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:39,601 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 [2019-02-25 15:37:39,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:39,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:39,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-25 15:37:39,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:39,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-25 15:37:39,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:39,715 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:41,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:41,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-25 15:37:41,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:41,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-25 15:37:41,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-25 15:37:41,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:37:41,435 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-02-25 15:37:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:41,487 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-02-25 15:37:41,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-25 15:37:41,488 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-02-25 15:37:41,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:41,489 INFO L225 Difference]: With dead ends: 45 [2019-02-25 15:37:41,489 INFO L226 Difference]: Without dead ends: 43 [2019-02-25 15:37:41,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:37:41,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-25 15:37:41,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-25 15:37:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:37:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-02-25 15:37:41,492 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-02-25 15:37:41,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:41,492 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-02-25 15:37:41,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-25 15:37:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-02-25 15:37:41,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-25 15:37:41,493 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:41,493 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-02-25 15:37:41,493 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:41,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:41,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-02-25 15:37:41,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:41,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:41,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:41,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:41,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:42,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:42,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:42,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:42,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:42,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:42,181 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 [2019-02-25 15:37:42,189 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:42,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:42,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:42,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:42,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 41 conjunts are in the unsatisfiable core [2019-02-25 15:37:42,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:42,224 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:44,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:44,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-25 15:37:44,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:44,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-25 15:37:44,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-25 15:37:44,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-25 15:37:44,275 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-02-25 15:37:44,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:44,361 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-25 15:37:44,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-25 15:37:44,362 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-02-25 15:37:44,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:44,362 INFO L225 Difference]: With dead ends: 46 [2019-02-25 15:37:44,363 INFO L226 Difference]: Without dead ends: 44 [2019-02-25 15:37:44,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-25 15:37:44,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-25 15:37:44,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-02-25 15:37:44,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-25 15:37:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-02-25 15:37:44,366 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-02-25 15:37:44,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:44,366 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-02-25 15:37:44,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-25 15:37:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-02-25 15:37:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-25 15:37:44,366 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:44,366 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-02-25 15:37:44,367 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:44,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:44,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-02-25 15:37:44,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:44,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:44,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:44,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:44,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:45,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:45,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:45,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:45,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:45,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:45,134 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 [2019-02-25 15:37:45,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:45,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:45,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-25 15:37:45,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:45,194 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:47,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:47,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-25 15:37:47,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:47,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-25 15:37:47,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-25 15:37:47,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-25 15:37:47,140 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-02-25 15:37:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:47,269 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-02-25 15:37:47,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-25 15:37:47,270 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-02-25 15:37:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:47,271 INFO L225 Difference]: With dead ends: 47 [2019-02-25 15:37:47,271 INFO L226 Difference]: Without dead ends: 45 [2019-02-25 15:37:47,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-25 15:37:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-25 15:37:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-25 15:37:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-25 15:37:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-02-25 15:37:47,273 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-02-25 15:37:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:47,273 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-02-25 15:37:47,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-25 15:37:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-02-25 15:37:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-25 15:37:47,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:47,274 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-02-25 15:37:47,274 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:47,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:47,274 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-02-25 15:37:47,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:47,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:47,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:47,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:47,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:48,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:48,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:48,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:48,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:48,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:48,119 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 [2019-02-25 15:37:48,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:48,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:48,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-25 15:37:48,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:48,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-25 15:37:48,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:48,253 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:50,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:50,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-25 15:37:50,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:50,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-25 15:37:50,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-25 15:37:50,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:37:50,576 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-02-25 15:37:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:50,649 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-25 15:37:50,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-25 15:37:50,649 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-02-25 15:37:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:50,650 INFO L225 Difference]: With dead ends: 48 [2019-02-25 15:37:50,650 INFO L226 Difference]: Without dead ends: 46 [2019-02-25 15:37:50,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:37:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-25 15:37:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-02-25 15:37:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-25 15:37:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-25 15:37:50,654 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-02-25 15:37:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:50,654 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-25 15:37:50,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-25 15:37:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-25 15:37:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-25 15:37:50,655 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:50,655 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-02-25 15:37:50,655 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:50,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:50,655 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-02-25 15:37:50,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:50,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:50,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:50,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:50,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:51,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:51,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:51,646 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:51,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:51,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:51,647 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 [2019-02-25 15:37:51,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:51,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:51,686 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:51,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:51,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-25 15:37:51,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:51,695 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:53,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:53,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-25 15:37:53,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:53,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-25 15:37:53,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-25 15:37:53,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-25 15:37:53,760 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-02-25 15:37:53,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:53,816 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-02-25 15:37:53,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-25 15:37:53,817 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-02-25 15:37:53,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:53,817 INFO L225 Difference]: With dead ends: 49 [2019-02-25 15:37:53,817 INFO L226 Difference]: Without dead ends: 47 [2019-02-25 15:37:53,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-25 15:37:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-25 15:37:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-25 15:37:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-25 15:37:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-02-25 15:37:53,821 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-02-25 15:37:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:53,822 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-02-25 15:37:53,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-25 15:37:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-02-25 15:37:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-25 15:37:53,822 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:53,822 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-02-25 15:37:53,822 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:53,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:53,823 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-02-25 15:37:53,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:53,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:53,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:53,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:53,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:54,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:54,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:54,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:54,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:54,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:54,997 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 [2019-02-25 15:37:55,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:55,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:55,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 45 conjunts are in the unsatisfiable core [2019-02-25 15:37:55,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:55,049 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:57,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:57,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-25 15:37:57,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:57,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-25 15:37:57,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-25 15:37:57,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-25 15:37:57,095 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-02-25 15:37:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:57,242 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-25 15:37:57,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-25 15:37:57,243 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-02-25 15:37:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:57,244 INFO L225 Difference]: With dead ends: 50 [2019-02-25 15:37:57,244 INFO L226 Difference]: Without dead ends: 48 [2019-02-25 15:37:57,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-25 15:37:57,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-25 15:37:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-02-25 15:37:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-25 15:37:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-02-25 15:37:57,246 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-02-25 15:37:57,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:57,247 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-02-25 15:37:57,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-25 15:37:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-02-25 15:37:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-25 15:37:57,247 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:57,248 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-02-25 15:37:57,248 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:57,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-02-25 15:37:57,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:57,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:57,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:57,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:57,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:58,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:58,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:58,151 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:58,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:58,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:58,152 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 [2019-02-25 15:37:58,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:58,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:58,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-25 15:37:58,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:58,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-25 15:37:58,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:58,300 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:00,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:00,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-25 15:38:00,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:00,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-25 15:38:00,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-25 15:38:00,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:38:00,848 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-02-25 15:38:00,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:00,906 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-25 15:38:00,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-25 15:38:00,906 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-02-25 15:38:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:00,907 INFO L225 Difference]: With dead ends: 51 [2019-02-25 15:38:00,907 INFO L226 Difference]: Without dead ends: 49 [2019-02-25 15:38:00,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:38:00,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-25 15:38:00,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-25 15:38:00,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-25 15:38:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-25 15:38:00,911 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-02-25 15:38:00,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:00,911 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-25 15:38:00,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-25 15:38:00,911 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-25 15:38:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-25 15:38:00,912 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:00,912 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-02-25 15:38:00,912 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:00,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:00,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-02-25 15:38:00,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:00,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:00,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:00,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:00,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:01,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:01,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:01,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:01,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:01,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:01,791 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 [2019-02-25 15:38:01,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:01,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:01,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:01,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:01,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-25 15:38:01,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:01,870 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:04,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:04,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-25 15:38:04,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:04,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-25 15:38:04,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-25 15:38:04,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:38:04,300 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-02-25 15:38:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:04,566 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-02-25 15:38:04,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-25 15:38:04,567 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-02-25 15:38:04,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:04,567 INFO L225 Difference]: With dead ends: 52 [2019-02-25 15:38:04,567 INFO L226 Difference]: Without dead ends: 50 [2019-02-25 15:38:04,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:38:04,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-25 15:38:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-02-25 15:38:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-25 15:38:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-02-25 15:38:04,571 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-02-25 15:38:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:04,572 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-02-25 15:38:04,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-25 15:38:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-02-25 15:38:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-02-25 15:38:04,572 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:04,572 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-02-25 15:38:04,573 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:04,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:04,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-02-25 15:38:04,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:04,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:04,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:04,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:04,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:05,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:05,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:05,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:05,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:05,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:05,507 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 [2019-02-25 15:38:05,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:05,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:05,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-25 15:38:05,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:05,558 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:07,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:07,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-25 15:38:07,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:07,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-25 15:38:07,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-25 15:38:07,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-25 15:38:07,954 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-02-25 15:38:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:08,052 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-02-25 15:38:08,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-25 15:38:08,053 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-02-25 15:38:08,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:08,054 INFO L225 Difference]: With dead ends: 53 [2019-02-25 15:38:08,054 INFO L226 Difference]: Without dead ends: 51 [2019-02-25 15:38:08,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-25 15:38:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-25 15:38:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-25 15:38:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-25 15:38:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-02-25 15:38:08,057 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-02-25 15:38:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:08,057 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-02-25 15:38:08,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-25 15:38:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-02-25 15:38:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-25 15:38:08,058 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:08,058 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-02-25 15:38:08,058 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:08,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:08,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-02-25 15:38:08,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:08,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:08,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:08,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:08,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:09,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:09,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:09,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:09,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:09,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:09,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:09,122 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 [2019-02-25 15:38:09,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:09,131 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:09,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-25 15:38:09,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:09,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-25 15:38:09,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:09,304 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:12,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:12,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-25 15:38:12,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:12,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-25 15:38:12,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-25 15:38:12,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:38:12,141 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-02-25 15:38:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:12,202 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-25 15:38:12,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-25 15:38:12,202 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-02-25 15:38:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:12,203 INFO L225 Difference]: With dead ends: 54 [2019-02-25 15:38:12,203 INFO L226 Difference]: Without dead ends: 52 [2019-02-25 15:38:12,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:38:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-25 15:38:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-02-25 15:38:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-25 15:38:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-25 15:38:12,207 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-02-25 15:38:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:12,207 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-25 15:38:12,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-25 15:38:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-25 15:38:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-25 15:38:12,208 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:12,208 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-02-25 15:38:12,208 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:12,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:12,209 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-02-25 15:38:12,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:12,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:12,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:12,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:12,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:13,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:13,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:13,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:13,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:13,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:13,118 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 [2019-02-25 15:38:13,126 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:13,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:13,155 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:13,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:13,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-25 15:38:13,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:13,165 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:15,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:15,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:15,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-25 15:38:15,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:15,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-25 15:38:15,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-25 15:38:15,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-25 15:38:15,960 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-02-25 15:38:16,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:16,101 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-25 15:38:16,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-25 15:38:16,101 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-02-25 15:38:16,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:16,102 INFO L225 Difference]: With dead ends: 55 [2019-02-25 15:38:16,102 INFO L226 Difference]: Without dead ends: 53 [2019-02-25 15:38:16,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-25 15:38:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-25 15:38:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-25 15:38:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-25 15:38:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-02-25 15:38:16,106 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-02-25 15:38:16,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:16,107 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-02-25 15:38:16,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-25 15:38:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-02-25 15:38:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-25 15:38:16,107 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:16,107 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-02-25 15:38:16,107 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:16,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:16,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-02-25 15:38:16,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:16,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:16,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:16,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:16,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:17,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:17,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:17,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:17,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:17,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:17,238 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 [2019-02-25 15:38:17,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:17,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:17,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-25 15:38:17,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:17,296 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:20,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:20,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-25 15:38:20,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:20,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-25 15:38:20,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-25 15:38:20,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:38:20,229 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-02-25 15:38:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:20,288 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-25 15:38:20,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-25 15:38:20,288 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-02-25 15:38:20,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:20,289 INFO L225 Difference]: With dead ends: 56 [2019-02-25 15:38:20,289 INFO L226 Difference]: Without dead ends: 54 [2019-02-25 15:38:20,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:38:20,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-25 15:38:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-02-25 15:38:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-25 15:38:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-02-25 15:38:20,293 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-02-25 15:38:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:20,294 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-02-25 15:38:20,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-25 15:38:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-02-25 15:38:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-02-25 15:38:20,294 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:20,294 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-02-25 15:38:20,294 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:20,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:20,295 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-02-25 15:38:20,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:20,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:20,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:20,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:20,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:21,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:21,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:21,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:21,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:21,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:21,361 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 [2019-02-25 15:38:21,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:21,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:21,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-25 15:38:21,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:21,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-25 15:38:21,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:21,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:24,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:24,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-25 15:38:24,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:24,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-25 15:38:24,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-25 15:38:24,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:38:24,488 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-02-25 15:38:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:24,712 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-02-25 15:38:24,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-25 15:38:24,712 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-02-25 15:38:24,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:24,712 INFO L225 Difference]: With dead ends: 57 [2019-02-25 15:38:24,713 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:38:24,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:38:24,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:38:24,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-25 15:38:24,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-25 15:38:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-02-25 15:38:24,718 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-02-25 15:38:24,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:24,718 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-02-25 15:38:24,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-25 15:38:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-02-25 15:38:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-25 15:38:24,718 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:24,718 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-02-25 15:38:24,719 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:24,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:24,719 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-02-25 15:38:24,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:24,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:24,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:24,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:24,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:25,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:25,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:25,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:25,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:25,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:25,834 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 [2019-02-25 15:38:25,843 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:25,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:25,877 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:25,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:25,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 53 conjunts are in the unsatisfiable core [2019-02-25 15:38:25,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:25,887 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:28,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:28,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-25 15:38:28,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:28,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-25 15:38:28,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-25 15:38:28,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:38:28,830 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-02-25 15:38:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:28,929 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-02-25 15:38:28,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-25 15:38:28,929 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-02-25 15:38:28,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:28,930 INFO L225 Difference]: With dead ends: 58 [2019-02-25 15:38:28,930 INFO L226 Difference]: Without dead ends: 56 [2019-02-25 15:38:28,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:38:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-25 15:38:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-02-25 15:38:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-25 15:38:28,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-25 15:38:28,933 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-02-25 15:38:28,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:28,934 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-25 15:38:28,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-25 15:38:28,934 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-25 15:38:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-25 15:38:28,934 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:28,934 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-02-25 15:38:28,934 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:28,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:28,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-02-25 15:38:28,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:28,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:28,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:28,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:28,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:30,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:30,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:30,371 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:30,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:30,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:30,371 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 [2019-02-25 15:38:30,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:30,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:30,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-25 15:38:30,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:30,422 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:34,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:34,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-25 15:38:34,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:34,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-25 15:38:34,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-25 15:38:34,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-25 15:38:34,005 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-02-25 15:38:34,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:34,110 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-02-25 15:38:34,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-25 15:38:34,111 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-02-25 15:38:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:34,112 INFO L225 Difference]: With dead ends: 59 [2019-02-25 15:38:34,112 INFO L226 Difference]: Without dead ends: 57 [2019-02-25 15:38:34,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-25 15:38:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-25 15:38:34,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-25 15:38:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-25 15:38:34,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-25 15:38:34,115 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-02-25 15:38:34,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:34,115 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-25 15:38:34,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-25 15:38:34,115 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-25 15:38:34,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-25 15:38:34,116 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:34,116 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-02-25 15:38:34,116 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:34,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:34,117 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-02-25 15:38:34,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:34,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:34,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:35,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:35,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:35,550 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:35,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:35,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:35,550 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 [2019-02-25 15:38:35,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:35,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:35,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-25 15:38:35,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:35,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-25 15:38:35,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:35,794 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:38,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:38,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-25 15:38:38,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:38,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-25 15:38:38,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-25 15:38:38,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:38:38,849 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-02-25 15:38:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:38,924 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-25 15:38:38,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-25 15:38:38,924 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-02-25 15:38:38,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:38,925 INFO L225 Difference]: With dead ends: 60 [2019-02-25 15:38:38,926 INFO L226 Difference]: Without dead ends: 58 [2019-02-25 15:38:38,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:38:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-25 15:38:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-02-25 15:38:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-25 15:38:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-25 15:38:38,928 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-02-25 15:38:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:38,928 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-25 15:38:38,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-25 15:38:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-25 15:38:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-25 15:38:38,929 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:38,929 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-02-25 15:38:38,929 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:38,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:38,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-02-25 15:38:38,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:38,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:38,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:38,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:38,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:40,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:40,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:40,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:40,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:40,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:40,446 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 [2019-02-25 15:38:40,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:40,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:40,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:40,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:40,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 56 conjunts are in the unsatisfiable core [2019-02-25 15:38:40,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:40,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:43,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:43,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-25 15:38:43,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:43,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-25 15:38:43,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-25 15:38:43,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-25 15:38:43,650 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-02-25 15:38:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:43,745 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-02-25 15:38:43,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-25 15:38:43,746 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-02-25 15:38:43,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:43,747 INFO L225 Difference]: With dead ends: 61 [2019-02-25 15:38:43,747 INFO L226 Difference]: Without dead ends: 59 [2019-02-25 15:38:43,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-25 15:38:43,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-25 15:38:43,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-25 15:38:43,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:38:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-02-25 15:38:43,749 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-02-25 15:38:43,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:43,749 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-02-25 15:38:43,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-25 15:38:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-02-25 15:38:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-25 15:38:43,750 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:43,750 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-02-25 15:38:43,750 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:43,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:43,750 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-02-25 15:38:43,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:43,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:43,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:43,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:43,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:45,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:45,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:45,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:45,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:45,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:45,409 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 [2019-02-25 15:38:45,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:45,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:45,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 57 conjunts are in the unsatisfiable core [2019-02-25 15:38:45,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:45,465 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:48,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:48,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-25 15:38:48,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:48,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-25 15:38:48,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-25 15:38:48,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-25 15:38:48,878 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-02-25 15:38:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:49,001 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-02-25 15:38:49,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-25 15:38:49,001 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-02-25 15:38:49,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:49,002 INFO L225 Difference]: With dead ends: 62 [2019-02-25 15:38:49,002 INFO L226 Difference]: Without dead ends: 60 [2019-02-25 15:38:49,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-25 15:38:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-25 15:38:49,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-02-25 15:38:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-25 15:38:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-02-25 15:38:49,005 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-02-25 15:38:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:49,006 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-02-25 15:38:49,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-25 15:38:49,006 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-02-25 15:38:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-25 15:38:49,006 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:49,006 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-02-25 15:38:49,006 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:49,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:49,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-02-25 15:38:49,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:49,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:49,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:49,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:49,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:50,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:50,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:50,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:50,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:50,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:50,437 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 [2019-02-25 15:38:50,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:50,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:50,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-25 15:38:50,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:50,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-25 15:38:50,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:50,704 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:54,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:54,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-25 15:38:54,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:54,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-25 15:38:54,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-25 15:38:54,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:38:54,183 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-02-25 15:38:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:54,261 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-25 15:38:54,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-25 15:38:54,262 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-02-25 15:38:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:54,263 INFO L225 Difference]: With dead ends: 63 [2019-02-25 15:38:54,263 INFO L226 Difference]: Without dead ends: 61 [2019-02-25 15:38:54,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:38:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-25 15:38:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-25 15:38:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:38:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-25 15:38:54,267 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-02-25 15:38:54,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:54,268 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-25 15:38:54,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-25 15:38:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-25 15:38:54,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-25 15:38:54,268 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:54,268 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-02-25 15:38:54,269 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:54,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:54,269 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-02-25 15:38:54,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:54,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:54,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:54,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:54,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:56,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:56,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:56,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:56,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:56,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:56,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:56,081 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 [2019-02-25 15:38:56,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:56,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:56,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:56,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:56,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-25 15:38:56,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:56,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:38:59,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:59,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-25 15:38:59,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:59,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-25 15:38:59,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-25 15:38:59,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-25 15:38:59,789 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-02-25 15:38:59,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:59,899 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-02-25 15:38:59,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-25 15:38:59,899 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-02-25 15:38:59,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:59,900 INFO L225 Difference]: With dead ends: 64 [2019-02-25 15:38:59,900 INFO L226 Difference]: Without dead ends: 62 [2019-02-25 15:38:59,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-25 15:38:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-25 15:38:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-02-25 15:38:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-25 15:38:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-25 15:38:59,903 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-02-25 15:38:59,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:59,904 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-25 15:38:59,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-25 15:38:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-25 15:38:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-25 15:38:59,905 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:59,905 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-02-25 15:38:59,905 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:59,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:59,905 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-02-25 15:38:59,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:59,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:59,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:59,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:59,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:01,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:01,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:01,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:01,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:01,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:01,745 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 [2019-02-25 15:39:01,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:01,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:39:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:01,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 60 conjunts are in the unsatisfiable core [2019-02-25 15:39:01,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:01,821 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:05,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:05,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:05,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-25 15:39:05,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:05,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-25 15:39:05,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-25 15:39:05,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-25 15:39:05,474 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-02-25 15:39:05,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:05,597 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-02-25 15:39:05,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-25 15:39:05,598 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-02-25 15:39:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:05,598 INFO L225 Difference]: With dead ends: 65 [2019-02-25 15:39:05,598 INFO L226 Difference]: Without dead ends: 63 [2019-02-25 15:39:05,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-25 15:39:05,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-25 15:39:05,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-25 15:39:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-25 15:39:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-02-25 15:39:05,602 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-02-25 15:39:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:05,603 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-02-25 15:39:05,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-25 15:39:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-02-25 15:39:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-25 15:39:05,603 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:05,603 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-02-25 15:39:05,603 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:05,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:05,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-02-25 15:39:05,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:05,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:05,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:05,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:05,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:10,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:10,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:10,481 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:10,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:10,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:10,481 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 [2019-02-25 15:39:10,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:39:10,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:39:10,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-25 15:39:10,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:10,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-25 15:39:10,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:10,808 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:14,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:14,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-25 15:39:14,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:14,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-25 15:39:14,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-25 15:39:14,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:39:14,745 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-02-25 15:39:14,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:14,826 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-25 15:39:14,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-25 15:39:14,826 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-02-25 15:39:14,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:14,827 INFO L225 Difference]: With dead ends: 66 [2019-02-25 15:39:14,827 INFO L226 Difference]: Without dead ends: 64 [2019-02-25 15:39:14,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:39:14,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-25 15:39:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-02-25 15:39:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-25 15:39:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-25 15:39:14,830 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-02-25 15:39:14,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:14,830 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-25 15:39:14,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-25 15:39:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-25 15:39:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-25 15:39:14,830 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:14,831 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-02-25 15:39:14,831 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:14,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:14,831 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-02-25 15:39:14,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:14,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:14,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:14,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:14,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:16,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:16,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:16,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:16,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:16,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:16,597 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 [2019-02-25 15:39:16,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:39:16,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:39:16,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:39:16,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:16,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-25 15:39:16,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:16,659 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:20,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:20,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-25 15:39:20,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:20,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-25 15:39:20,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-25 15:39:20,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-25 15:39:20,595 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-02-25 15:39:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:20,707 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-02-25 15:39:20,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-25 15:39:20,707 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-02-25 15:39:20,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:20,708 INFO L225 Difference]: With dead ends: 67 [2019-02-25 15:39:20,708 INFO L226 Difference]: Without dead ends: 65 [2019-02-25 15:39:20,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-25 15:39:20,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-25 15:39:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-25 15:39:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-25 15:39:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-02-25 15:39:20,710 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-02-25 15:39:20,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:20,710 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-02-25 15:39:20,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-25 15:39:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-02-25 15:39:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-25 15:39:20,711 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:20,711 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-02-25 15:39:20,711 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:20,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:20,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-02-25 15:39:20,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:20,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:20,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:20,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:20,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:22,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:22,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:22,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:22,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:22,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:22,467 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 [2019-02-25 15:39:22,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:22,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:39:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:22,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-25 15:39:22,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:22,528 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:26,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:26,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-25 15:39:26,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:26,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-25 15:39:26,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-25 15:39:26,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-25 15:39:26,899 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-02-25 15:39:27,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:27,046 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-02-25 15:39:27,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-25 15:39:27,047 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-02-25 15:39:27,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:27,047 INFO L225 Difference]: With dead ends: 68 [2019-02-25 15:39:27,047 INFO L226 Difference]: Without dead ends: 66 [2019-02-25 15:39:27,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-25 15:39:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-02-25 15:39:27,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-02-25 15:39:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-25 15:39:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-25 15:39:27,051 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-02-25 15:39:27,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:27,051 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-25 15:39:27,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-25 15:39:27,051 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-25 15:39:27,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-25 15:39:27,052 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:27,052 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-02-25 15:39:27,052 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:27,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:27,052 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-02-25 15:39:27,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:27,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:27,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:27,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:27,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:29,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:29,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:29,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:29,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:29,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:29,615 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 [2019-02-25 15:39:29,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:39:29,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:39:29,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-25 15:39:29,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:29,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-25 15:39:29,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:29,973 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:34,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:34,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-25 15:39:34,518 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:34,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-25 15:39:34,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-25 15:39:34,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:39:34,519 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-02-25 15:39:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:34,641 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-02-25 15:39:34,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-25 15:39:34,641 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-02-25 15:39:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:34,642 INFO L225 Difference]: With dead ends: 69 [2019-02-25 15:39:34,642 INFO L226 Difference]: Without dead ends: 67 [2019-02-25 15:39:34,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:39:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-25 15:39:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-25 15:39:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-25 15:39:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-02-25 15:39:34,645 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-02-25 15:39:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:34,646 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-02-25 15:39:34,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-25 15:39:34,646 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-02-25 15:39:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-25 15:39:34,646 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:34,646 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-02-25 15:39:34,646 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:34,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:34,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-02-25 15:39:34,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:34,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:34,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:34,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:37,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:37,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:37,174 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:37,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:37,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:37,175 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 [2019-02-25 15:39:37,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:39:37,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:39:37,254 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:39:37,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:37,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 65 conjunts are in the unsatisfiable core [2019-02-25 15:39:37,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:37,273 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:41,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:41,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-25 15:39:41,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:41,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-25 15:39:41,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-25 15:39:41,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-25 15:39:41,974 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-02-25 15:39:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:42,093 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-25 15:39:42,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-25 15:39:42,100 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-02-25 15:39:42,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:42,101 INFO L225 Difference]: With dead ends: 70 [2019-02-25 15:39:42,101 INFO L226 Difference]: Without dead ends: 68 [2019-02-25 15:39:42,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-25 15:39:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-25 15:39:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-02-25 15:39:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-25 15:39:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-02-25 15:39:42,105 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-02-25 15:39:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:42,105 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-02-25 15:39:42,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-25 15:39:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-02-25 15:39:42,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-25 15:39:42,105 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:42,106 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-02-25 15:39:42,106 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:42,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:42,106 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-02-25 15:39:42,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:42,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:42,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:42,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:42,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:43,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:43,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:43,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:43,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:43,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:43,715 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 [2019-02-25 15:39:43,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:43,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:39:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:43,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 66 conjunts are in the unsatisfiable core [2019-02-25 15:39:43,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:43,780 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:48,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:48,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-25 15:39:48,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:48,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-25 15:39:48,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-25 15:39:48,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-25 15:39:48,561 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-02-25 15:39:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:48,652 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-25 15:39:48,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-25 15:39:48,652 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-02-25 15:39:48,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:48,653 INFO L225 Difference]: With dead ends: 71 [2019-02-25 15:39:48,653 INFO L226 Difference]: Without dead ends: 69 [2019-02-25 15:39:48,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-25 15:39:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-25 15:39:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-25 15:39:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-25 15:39:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-02-25 15:39:48,657 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-02-25 15:39:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:48,657 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-02-25 15:39:48,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-25 15:39:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-02-25 15:39:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-25 15:39:48,657 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:48,657 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-02-25 15:39:48,658 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:48,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-02-25 15:39:48,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:48,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:48,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:48,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:48,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:50,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:50,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:50,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:50,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:50,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:50,242 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 [2019-02-25 15:39:50,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:39:50,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:39:50,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-25 15:39:50,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:50,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-25 15:39:50,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:50,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:56,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:56,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-25 15:39:56,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:56,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-25 15:39:56,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-25 15:39:56,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:39:56,614 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-02-25 15:39:56,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:56,734 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-25 15:39:56,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-25 15:39:56,735 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-02-25 15:39:56,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:56,735 INFO L225 Difference]: With dead ends: 72 [2019-02-25 15:39:56,735 INFO L226 Difference]: Without dead ends: 70 [2019-02-25 15:39:56,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:39:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-25 15:39:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-02-25 15:39:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-25 15:39:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-25 15:39:56,739 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-02-25 15:39:56,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:56,740 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-25 15:39:56,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-25 15:39:56,740 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-25 15:39:56,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-25 15:39:56,740 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:56,740 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-02-25 15:39:56,741 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:56,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:56,741 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-02-25 15:39:56,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:56,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:56,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:56,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:56,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:58,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:58,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:58,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:58,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:58,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:58,595 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 [2019-02-25 15:39:58,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:39:58,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:39:58,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:39:58,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:58,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-25 15:39:58,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:39:58,673 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:03,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:03,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-25 15:40:03,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:03,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-25 15:40:03,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-25 15:40:03,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-25 15:40:03,610 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-02-25 15:40:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:03,964 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-02-25 15:40:03,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-25 15:40:03,965 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-02-25 15:40:03,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:03,965 INFO L225 Difference]: With dead ends: 73 [2019-02-25 15:40:03,965 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:40:03,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-25 15:40:03,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:40:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-25 15:40:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-25 15:40:03,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-02-25 15:40:03,968 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-02-25 15:40:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:03,968 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-02-25 15:40:03,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-25 15:40:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-02-25 15:40:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-25 15:40:03,969 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:03,969 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-02-25 15:40:03,969 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-02-25 15:40:03,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:03,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:03,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:40:03,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:03,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:05,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:05,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:05,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:05,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:05,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:05,718 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 [2019-02-25 15:40:05,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:05,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:40:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:05,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 69 conjunts are in the unsatisfiable core [2019-02-25 15:40:05,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:05,782 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:10,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:10,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-25 15:40:10,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:10,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-25 15:40:10,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-25 15:40:10,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-25 15:40:10,757 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-02-25 15:40:10,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:10,854 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-02-25 15:40:10,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-25 15:40:10,855 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-02-25 15:40:10,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:10,856 INFO L225 Difference]: With dead ends: 74 [2019-02-25 15:40:10,856 INFO L226 Difference]: Without dead ends: 72 [2019-02-25 15:40:10,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-25 15:40:10,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-25 15:40:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-02-25 15:40:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-25 15:40:10,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-25 15:40:10,860 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-02-25 15:40:10,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:10,861 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-25 15:40:10,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-25 15:40:10,861 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-25 15:40:10,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-25 15:40:10,861 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:10,861 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-02-25 15:40:10,861 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:10,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:10,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-02-25 15:40:10,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:10,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:10,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:10,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:10,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:12,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:12,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:12,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:12,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:12,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:12,979 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 [2019-02-25 15:40:13,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:40:13,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:40:13,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-25 15:40:13,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:40:13,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-25 15:40:13,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:13,473 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:18,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:18,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-25 15:40:18,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:18,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-25 15:40:18,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-25 15:40:18,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:40:18,693 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-02-25 15:40:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:18,901 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-25 15:40:18,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-25 15:40:18,901 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-02-25 15:40:18,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:18,902 INFO L225 Difference]: With dead ends: 75 [2019-02-25 15:40:18,902 INFO L226 Difference]: Without dead ends: 73 [2019-02-25 15:40:18,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:40:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-25 15:40:18,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-25 15:40:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-25 15:40:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-25 15:40:18,905 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-02-25 15:40:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:18,905 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-25 15:40:18,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-25 15:40:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-25 15:40:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-25 15:40:18,905 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:18,906 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-02-25 15:40:18,906 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:18,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:18,906 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-02-25 15:40:18,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:18,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:18,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:40:18,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:18,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:20,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:20,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:20,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:20,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:20,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:20,759 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 [2019-02-25 15:40:20,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:40:20,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:40:20,812 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:40:20,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:40:20,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 71 conjunts are in the unsatisfiable core [2019-02-25 15:40:20,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:20,825 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:26,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:26,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-25 15:40:26,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:26,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-25 15:40:26,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-25 15:40:26,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-25 15:40:26,228 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-02-25 15:40:26,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:26,425 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-25 15:40:26,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-25 15:40:26,425 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-02-25 15:40:26,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:26,426 INFO L225 Difference]: With dead ends: 76 [2019-02-25 15:40:26,426 INFO L226 Difference]: Without dead ends: 74 [2019-02-25 15:40:26,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-25 15:40:26,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-25 15:40:26,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-02-25 15:40:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-25 15:40:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-02-25 15:40:26,430 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-02-25 15:40:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:26,430 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-02-25 15:40:26,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-25 15:40:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-02-25 15:40:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-02-25 15:40:26,431 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:26,431 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-02-25 15:40:26,431 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:26,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-02-25 15:40:26,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:26,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:26,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:40:26,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:26,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:28,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:28,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:28,637 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:28,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:28,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:28,638 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 [2019-02-25 15:40:28,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:28,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:40:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:28,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-25 15:40:28,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:28,708 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:34,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:34,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-25 15:40:34,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:34,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-25 15:40:34,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-25 15:40:34,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-25 15:40:34,225 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-02-25 15:40:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:34,402 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-02-25 15:40:34,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-25 15:40:34,402 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-02-25 15:40:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:34,403 INFO L225 Difference]: With dead ends: 77 [2019-02-25 15:40:34,403 INFO L226 Difference]: Without dead ends: 75 [2019-02-25 15:40:34,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-25 15:40:34,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-25 15:40:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-25 15:40:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-25 15:40:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-02-25 15:40:34,408 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-02-25 15:40:34,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:34,408 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-02-25 15:40:34,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-25 15:40:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-02-25 15:40:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-25 15:40:34,409 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:34,409 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-02-25 15:40:34,410 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-02-25 15:40:34,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:34,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:34,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:34,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:34,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:36,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:36,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:36,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:36,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:36,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:36,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:36,596 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 [2019-02-25 15:40:36,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:40:36,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:40:37,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-25 15:40:37,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:40:37,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-25 15:40:37,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:37,168 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:43,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:43,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-25 15:40:43,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:43,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-25 15:40:43,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-25 15:40:43,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:40:43,264 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-02-25 15:40:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:43,415 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-25 15:40:43,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-25 15:40:43,416 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-02-25 15:40:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:43,417 INFO L225 Difference]: With dead ends: 78 [2019-02-25 15:40:43,417 INFO L226 Difference]: Without dead ends: 76 [2019-02-25 15:40:43,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:40:43,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-25 15:40:43,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-02-25 15:40:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-25 15:40:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-25 15:40:43,420 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-02-25 15:40:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:43,421 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-25 15:40:43,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-25 15:40:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-25 15:40:43,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-25 15:40:43,421 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:43,422 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-02-25 15:40:43,422 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:43,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:43,422 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-02-25 15:40:43,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:43,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:43,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:40:43,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:43,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:45,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:45,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:45,550 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:45,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:45,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:45,550 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 [2019-02-25 15:40:45,560 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:40:45,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:40:45,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:40:45,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:40:45,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-25 15:40:45,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:45,630 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:51,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:51,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-25 15:40:51,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:51,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-25 15:40:51,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-25 15:40:51,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-25 15:40:51,532 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-02-25 15:40:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:51,687 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-02-25 15:40:51,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-25 15:40:51,687 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-02-25 15:40:51,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:51,688 INFO L225 Difference]: With dead ends: 79 [2019-02-25 15:40:51,688 INFO L226 Difference]: Without dead ends: 77 [2019-02-25 15:40:51,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-25 15:40:51,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-25 15:40:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-25 15:40:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-25 15:40:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-25 15:40:51,692 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-02-25 15:40:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:51,692 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-25 15:40:51,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-25 15:40:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-25 15:40:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-25 15:40:51,693 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:51,693 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-02-25 15:40:51,693 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:51,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:51,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-02-25 15:40:51,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:51,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:51,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:40:51,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:51,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:54,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:54,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:54,374 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:54,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:54,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:54,374 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 [2019-02-25 15:40:54,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:54,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:40:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:54,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-25 15:40:54,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:40:54,450 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:00,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:00,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-25 15:41:00,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:00,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-25 15:41:00,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-25 15:41:00,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-25 15:41:00,652 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-02-25 15:41:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:00,807 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-25 15:41:00,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-25 15:41:00,807 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-02-25 15:41:00,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:00,808 INFO L225 Difference]: With dead ends: 80 [2019-02-25 15:41:00,808 INFO L226 Difference]: Without dead ends: 78 [2019-02-25 15:41:00,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-25 15:41:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-25 15:41:00,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-02-25 15:41:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-25 15:41:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-02-25 15:41:00,811 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-02-25 15:41:00,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:00,812 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-02-25 15:41:00,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-25 15:41:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-02-25 15:41:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-02-25 15:41:00,812 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:00,812 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-02-25 15:41:00,812 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:00,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:00,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-02-25 15:41:00,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:00,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:00,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:03,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:03,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:03,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:03,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:03,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:03,017 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 [2019-02-25 15:41:03,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:41:03,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:41:03,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-25 15:41:03,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:41:03,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-25 15:41:03,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:03,666 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:09,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:09,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-25 15:41:09,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:09,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-25 15:41:09,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-25 15:41:09,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:41:09,829 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-02-25 15:41:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:09,948 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-02-25 15:41:09,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-25 15:41:09,949 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-02-25 15:41:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:09,950 INFO L225 Difference]: With dead ends: 81 [2019-02-25 15:41:09,950 INFO L226 Difference]: Without dead ends: 79 [2019-02-25 15:41:09,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:41:09,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-25 15:41:09,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-25 15:41:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-25 15:41:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-02-25 15:41:09,955 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-02-25 15:41:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:09,955 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-02-25 15:41:09,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-25 15:41:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-02-25 15:41:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-25 15:41:09,956 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:09,956 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-02-25 15:41:09,956 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:09,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:09,957 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-02-25 15:41:09,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:09,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:09,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:41:09,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:09,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:12,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:12,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:12,073 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:12,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:12,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:12,073 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 [2019-02-25 15:41:12,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:41:12,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:41:12,129 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:41:12,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:41:12,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 77 conjunts are in the unsatisfiable core [2019-02-25 15:41:12,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:12,153 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:18,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:18,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-25 15:41:18,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:18,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-25 15:41:18,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-25 15:41:18,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:41:18,787 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-02-25 15:41:18,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:18,965 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-02-25 15:41:18,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-25 15:41:18,965 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-02-25 15:41:18,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:18,966 INFO L225 Difference]: With dead ends: 82 [2019-02-25 15:41:18,966 INFO L226 Difference]: Without dead ends: 80 [2019-02-25 15:41:18,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:41:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-25 15:41:18,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-02-25 15:41:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-25 15:41:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-02-25 15:41:18,969 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-02-25 15:41:18,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:18,970 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-02-25 15:41:18,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-25 15:41:18,970 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-02-25 15:41:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-25 15:41:18,970 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:18,970 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-02-25 15:41:18,970 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:18,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:18,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-02-25 15:41:18,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:18,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:18,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:41:18,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:18,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:21,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:21,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:21,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:21,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:21,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:21,133 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 [2019-02-25 15:41:21,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:21,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:41:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:21,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 78 conjunts are in the unsatisfiable core [2019-02-25 15:41:21,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:21,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:27,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:27,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:27,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-25 15:41:27,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:27,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-25 15:41:27,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-25 15:41:27,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:41:27,992 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-02-25 15:41:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:28,364 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-02-25 15:41:28,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-25 15:41:28,364 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-02-25 15:41:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:28,364 INFO L225 Difference]: With dead ends: 83 [2019-02-25 15:41:28,365 INFO L226 Difference]: Without dead ends: 81 [2019-02-25 15:41:28,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:41:28,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-25 15:41:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-25 15:41:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-25 15:41:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-25 15:41:28,368 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-02-25 15:41:28,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:28,368 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-25 15:41:28,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-25 15:41:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-25 15:41:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-25 15:41:28,369 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:28,369 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-02-25 15:41:28,369 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:28,370 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-02-25 15:41:28,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:28,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:28,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:28,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:28,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:30,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:30,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:30,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:30,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:30,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:30,827 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 [2019-02-25 15:41:30,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:41:30,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:41:31,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-25 15:41:31,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:41:31,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-25 15:41:31,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:31,588 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:39,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:39,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-25 15:41:39,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:39,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-25 15:41:39,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-25 15:41:39,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:41:39,465 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-02-25 15:41:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:40,093 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-25 15:41:40,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-25 15:41:40,094 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-02-25 15:41:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:40,095 INFO L225 Difference]: With dead ends: 84 [2019-02-25 15:41:40,095 INFO L226 Difference]: Without dead ends: 82 [2019-02-25 15:41:40,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:41:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-25 15:41:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-02-25 15:41:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-25 15:41:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-25 15:41:40,099 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-02-25 15:41:40,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:40,099 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-25 15:41:40,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-25 15:41:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-25 15:41:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-25 15:41:40,100 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:40,100 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-02-25 15:41:40,100 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:40,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:40,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-02-25 15:41:40,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:40,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:40,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:41:40,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:40,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:42,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:42,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:42,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:42,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:42,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:42,445 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 [2019-02-25 15:41:42,455 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:41:42,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:41:42,517 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:41:42,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:41:42,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-25 15:41:42,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:42,543 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:49,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:49,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-25 15:41:49,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:49,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-25 15:41:49,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-25 15:41:49,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:41:49,857 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-02-25 15:41:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:50,016 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-02-25 15:41:50,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-25 15:41:50,017 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-02-25 15:41:50,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:50,017 INFO L225 Difference]: With dead ends: 85 [2019-02-25 15:41:50,017 INFO L226 Difference]: Without dead ends: 83 [2019-02-25 15:41:50,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:41:50,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-25 15:41:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-25 15:41:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-25 15:41:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-02-25 15:41:50,021 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-02-25 15:41:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:50,021 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-02-25 15:41:50,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-25 15:41:50,022 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-02-25 15:41:50,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-25 15:41:50,022 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:50,022 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-02-25 15:41:50,022 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:50,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:50,023 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-02-25 15:41:50,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:50,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:50,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:41:50,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:50,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:52,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:52,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:52,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:52,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:52,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:52,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 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 [2019-02-25 15:41:52,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:52,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:41:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:52,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 81 conjunts are in the unsatisfiable core [2019-02-25 15:41:52,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:52,607 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:41:59,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:59,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-25 15:41:59,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:59,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-25 15:41:59,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-25 15:41:59,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:41:59,582 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-02-25 15:41:59,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:59,752 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-25 15:41:59,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-25 15:41:59,752 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-02-25 15:41:59,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:59,753 INFO L225 Difference]: With dead ends: 86 [2019-02-25 15:41:59,753 INFO L226 Difference]: Without dead ends: 84 [2019-02-25 15:41:59,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:41:59,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-25 15:41:59,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-02-25 15:41:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-25 15:41:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-02-25 15:41:59,756 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-02-25 15:41:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:59,756 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-02-25 15:41:59,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-25 15:41:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-02-25 15:41:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-25 15:41:59,756 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:59,756 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-02-25 15:41:59,756 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:59,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:59,757 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-02-25 15:41:59,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:59,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:59,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:59,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:59,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:02,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:02,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:02,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:02,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:02,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:02,231 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 [2019-02-25 15:42:02,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:42:02,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:42:03,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-25 15:42:03,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:42:03,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-25 15:42:03,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:03,070 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:10,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:10,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-25 15:42:10,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:10,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-25 15:42:10,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-25 15:42:10,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:42:10,338 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-02-25 15:42:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:10,528 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-25 15:42:10,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-25 15:42:10,528 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-02-25 15:42:10,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:10,529 INFO L225 Difference]: With dead ends: 87 [2019-02-25 15:42:10,529 INFO L226 Difference]: Without dead ends: 85 [2019-02-25 15:42:10,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:42:10,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-25 15:42:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-25 15:42:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-25 15:42:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-25 15:42:10,533 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-02-25 15:42:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:10,533 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-25 15:42:10,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-25 15:42:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-25 15:42:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-25 15:42:10,534 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:10,534 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-02-25 15:42:10,534 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:10,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-02-25 15:42:10,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:10,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:10,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:42:10,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:10,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:13,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:13,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:13,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:13,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:13,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:13,150 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:42:13,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:42:13,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:42:13,211 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:42:13,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:42:13,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-25 15:42:13,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:13,227 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:20,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:20,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-25 15:42:20,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:20,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-25 15:42:20,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-25 15:42:20,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:42:20,795 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-02-25 15:42:20,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:20,972 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-02-25 15:42:20,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-25 15:42:20,972 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-02-25 15:42:20,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:20,973 INFO L225 Difference]: With dead ends: 88 [2019-02-25 15:42:20,973 INFO L226 Difference]: Without dead ends: 86 [2019-02-25 15:42:20,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:42:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-25 15:42:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-02-25 15:42:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-25 15:42:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-25 15:42:20,976 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-02-25 15:42:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:20,976 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-25 15:42:20,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-25 15:42:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-25 15:42:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-25 15:42:20,977 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:20,977 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-02-25 15:42:20,977 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:20,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:20,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-02-25 15:42:20,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:20,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:20,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:42:20,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:20,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:23,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:23,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:23,417 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:23,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:23,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:23,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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:42:23,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:42:23,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:42:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:23,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 84 conjunts are in the unsatisfiable core [2019-02-25 15:42:23,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:23,495 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:31,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:31,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-25 15:42:31,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:31,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-25 15:42:31,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-25 15:42:31,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:42:31,222 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-02-25 15:42:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:31,453 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-02-25 15:42:31,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-25 15:42:31,453 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-02-25 15:42:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:31,454 INFO L225 Difference]: With dead ends: 89 [2019-02-25 15:42:31,454 INFO L226 Difference]: Without dead ends: 87 [2019-02-25 15:42:31,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:42:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-25 15:42:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-25 15:42:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-25 15:42:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-02-25 15:42:31,458 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-02-25 15:42:31,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:31,458 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-02-25 15:42:31,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-25 15:42:31,458 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-02-25 15:42:31,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-25 15:42:31,458 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:31,458 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-02-25 15:42:31,459 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:31,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:31,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-02-25 15:42:31,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:31,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:31,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:42:31,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:31,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:34,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:34,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:34,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:34,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:34,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:34,053 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:42:34,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:42:34,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:42:35,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-25 15:42:35,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:42:35,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-25 15:42:35,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:35,029 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:42,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:42,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-25 15:42:42,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:42,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-25 15:42:42,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-25 15:42:42,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:42:42,626 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-02-25 15:42:42,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:42,783 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-25 15:42:42,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-25 15:42:42,783 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-02-25 15:42:42,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:42,784 INFO L225 Difference]: With dead ends: 90 [2019-02-25 15:42:42,784 INFO L226 Difference]: Without dead ends: 88 [2019-02-25 15:42:42,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:42:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-02-25 15:42:42,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-02-25 15:42:42,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-25 15:42:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-25 15:42:42,788 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-02-25 15:42:42,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:42,788 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-25 15:42:42,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-25 15:42:42,788 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-25 15:42:42,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-25 15:42:42,788 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:42,789 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-02-25 15:42:42,789 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:42,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:42,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-02-25 15:42:42,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:42,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:42,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:42:42,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:42,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:45,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:45,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:45,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:45,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:45,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:45,357 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:42:45,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:42:45,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:42:45,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:42:45,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:42:45,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 86 conjunts are in the unsatisfiable core [2019-02-25 15:42:45,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:45,441 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:53,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:53,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-25 15:42:53,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:53,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-25 15:42:53,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-25 15:42:53,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:42:53,537 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-02-25 15:42:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:53,699 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-25 15:42:53,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-25 15:42:53,700 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-02-25 15:42:53,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:53,700 INFO L225 Difference]: With dead ends: 91 [2019-02-25 15:42:53,700 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:42:53,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:42:53,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:42:53,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-25 15:42:53,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-25 15:42:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-02-25 15:42:53,703 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-02-25 15:42:53,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:53,704 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-02-25 15:42:53,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-25 15:42:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-02-25 15:42:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-25 15:42:53,704 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:53,705 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-02-25 15:42:53,705 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:53,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:53,705 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-02-25 15:42:53,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:53,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:53,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:42:53,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:53,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:56,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:56,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:56,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:56,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:56,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:56,619 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:42:56,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:42:56,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:42:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:56,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 87 conjunts are in the unsatisfiable core [2019-02-25 15:42:56,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:56,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:04,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:04,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-25 15:43:04,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:04,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-25 15:43:04,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-25 15:43:04,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:43:04,746 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-02-25 15:43:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:05,137 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-02-25 15:43:05,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-25 15:43:05,138 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-02-25 15:43:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:05,138 INFO L225 Difference]: With dead ends: 92 [2019-02-25 15:43:05,138 INFO L226 Difference]: Without dead ends: 90 [2019-02-25 15:43:05,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:43:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-25 15:43:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-02-25 15:43:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-25 15:43:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-02-25 15:43:05,141 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-02-25 15:43:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:05,142 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-02-25 15:43:05,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-25 15:43:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-02-25 15:43:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-02-25 15:43:05,142 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:05,143 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-02-25 15:43:05,143 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:05,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:05,143 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-02-25 15:43:05,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:05,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:05,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:43:05,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:05,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:08,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:08,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:08,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:08,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:08,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:08,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:08,159 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:43:08,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:43:08,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:43:09,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-25 15:43:09,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:43:09,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-25 15:43:09,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:09,228 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:17,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:17,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-25 15:43:17,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:17,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-25 15:43:17,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-25 15:43:17,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:43:17,734 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-02-25 15:43:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:17,966 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-02-25 15:43:17,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-25 15:43:17,967 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-02-25 15:43:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:17,967 INFO L225 Difference]: With dead ends: 93 [2019-02-25 15:43:17,967 INFO L226 Difference]: Without dead ends: 91 [2019-02-25 15:43:17,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:43:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-25 15:43:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-25 15:43:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-25 15:43:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-02-25 15:43:17,972 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-02-25 15:43:17,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:17,972 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-02-25 15:43:17,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-25 15:43:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-02-25 15:43:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-25 15:43:17,973 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:17,973 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-02-25 15:43:17,973 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:17,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:17,973 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-02-25 15:43:17,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:17,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:17,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:43:17,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:17,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:20,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:20,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:20,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:20,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:20,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:20,716 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:43:20,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:43:20,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:43:20,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:43:20,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:43:20,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 89 conjunts are in the unsatisfiable core [2019-02-25 15:43:20,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:20,798 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:29,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:29,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-25 15:43:29,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:29,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-25 15:43:29,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-25 15:43:29,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:43:29,138 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-02-25 15:43:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:29,274 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-02-25 15:43:29,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-25 15:43:29,274 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-02-25 15:43:29,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:29,275 INFO L225 Difference]: With dead ends: 94 [2019-02-25 15:43:29,275 INFO L226 Difference]: Without dead ends: 92 [2019-02-25 15:43:29,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:43:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-25 15:43:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-02-25 15:43:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-25 15:43:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-25 15:43:29,279 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-02-25 15:43:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:29,279 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-25 15:43:29,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-25 15:43:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-25 15:43:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-25 15:43:29,279 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:29,279 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-02-25 15:43:29,280 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:29,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-02-25 15:43:29,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:29,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:43:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:29,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:32,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:32,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:32,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:32,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:32,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:32,538 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:43:32,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:43:32,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:43:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:32,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 90 conjunts are in the unsatisfiable core [2019-02-25 15:43:32,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:32,620 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:41,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:41,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-25 15:43:41,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:41,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-25 15:43:41,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-25 15:43:41,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:43:41,216 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-02-25 15:43:41,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:41,447 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-25 15:43:41,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-25 15:43:41,447 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-02-25 15:43:41,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:41,448 INFO L225 Difference]: With dead ends: 95 [2019-02-25 15:43:41,448 INFO L226 Difference]: Without dead ends: 93 [2019-02-25 15:43:41,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:43:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-25 15:43:41,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-25 15:43:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-25 15:43:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-02-25 15:43:41,451 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-02-25 15:43:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:41,451 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-02-25 15:43:41,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-25 15:43:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-02-25 15:43:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-25 15:43:41,452 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:41,452 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-02-25 15:43:41,452 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:41,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:41,452 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-02-25 15:43:41,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:41,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:41,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:43:41,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:41,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:44,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:44,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:44,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:44,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:44,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:44,615 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:43:44,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:43:44,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:43:45,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-25 15:43:45,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:43:45,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-25 15:43:45,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:45,862 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:54,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:54,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-25 15:43:54,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:54,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-25 15:43:54,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-25 15:43:54,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:43:54,603 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-02-25 15:43:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:54,746 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-25 15:43:54,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-25 15:43:54,746 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-02-25 15:43:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:54,747 INFO L225 Difference]: With dead ends: 96 [2019-02-25 15:43:54,748 INFO L226 Difference]: Without dead ends: 94 [2019-02-25 15:43:54,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:43:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-25 15:43:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-02-25 15:43:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-25 15:43:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-25 15:43:54,752 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-02-25 15:43:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:54,752 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-25 15:43:54,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-25 15:43:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-25 15:43:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-25 15:43:54,753 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:54,753 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-02-25 15:43:54,753 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:54,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:54,753 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-02-25 15:43:54,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:54,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:54,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:43:54,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:54,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:58,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:58,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:58,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:58,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:58,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:58,063 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:43:58,072 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:43:58,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:43:58,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:43:58,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:43:58,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 92 conjunts are in the unsatisfiable core [2019-02-25 15:43:58,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:58,150 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:44:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:07,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:44:07,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-25 15:44:07,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:44:07,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-25 15:44:07,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-25 15:44:07,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:44:07,227 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-02-25 15:44:07,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:07,468 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-02-25 15:44:07,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-25 15:44:07,469 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-02-25 15:44:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:07,469 INFO L225 Difference]: With dead ends: 97 [2019-02-25 15:44:07,470 INFO L226 Difference]: Without dead ends: 95 [2019-02-25 15:44:07,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:44:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-25 15:44:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-25 15:44:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-25 15:44:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-02-25 15:44:07,474 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-02-25 15:44:07,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:07,474 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-02-25 15:44:07,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-25 15:44:07,474 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-02-25 15:44:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-25 15:44:07,475 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:07,475 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-02-25 15:44:07,475 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:07,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:07,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-02-25 15:44:07,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:07,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:07,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:44:07,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:07,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:10,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:10,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:10,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:10,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:10,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:10,811 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:44:10,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:44:10,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:44:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:10,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 93 conjunts are in the unsatisfiable core [2019-02-25 15:44:10,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:10,903 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:44:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:20,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:44:20,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-25 15:44:20,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:44:20,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-25 15:44:20,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-25 15:44:20,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:44:20,359 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-02-25 15:44:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:20,558 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-02-25 15:44:20,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-25 15:44:20,558 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-02-25 15:44:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:20,559 INFO L225 Difference]: With dead ends: 98 [2019-02-25 15:44:20,559 INFO L226 Difference]: Without dead ends: 96 [2019-02-25 15:44:20,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:44:20,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-02-25 15:44:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-02-25 15:44:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-25 15:44:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-25 15:44:20,563 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-02-25 15:44:20,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:20,563 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-25 15:44:20,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-25 15:44:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-25 15:44:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-25 15:44:20,563 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:20,563 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-02-25 15:44:20,564 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:20,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:20,564 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-02-25 15:44:20,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:20,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:20,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:44:20,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:20,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:24,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:24,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:24,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:24,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:24,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:24,031 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:44:24,038 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:44:24,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:44:25,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-25 15:44:25,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:44:25,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-25 15:44:25,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:25,380 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:44:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:35,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:44:35,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-25 15:44:35,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:44:35,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-25 15:44:35,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-25 15:44:35,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:44:35,011 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-02-25 15:44:35,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:35,168 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-25 15:44:35,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-25 15:44:35,169 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-02-25 15:44:35,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:35,169 INFO L225 Difference]: With dead ends: 99 [2019-02-25 15:44:35,169 INFO L226 Difference]: Without dead ends: 97 [2019-02-25 15:44:35,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:44:35,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-25 15:44:35,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-25 15:44:35,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-25 15:44:35,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-25 15:44:35,172 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-02-25 15:44:35,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:35,173 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-25 15:44:35,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-25 15:44:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-25 15:44:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-25 15:44:35,173 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:35,174 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-02-25 15:44:35,174 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:35,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:35,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-02-25 15:44:35,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:35,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:35,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:44:35,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:35,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:38,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:38,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:38,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:38,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:38,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:38,271 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:44:38,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:44:38,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:44:38,341 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:44:38,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:44:38,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-25 15:44:38,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:38,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:38,382 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:44:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:48,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:44:48,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-25 15:44:48,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:44:48,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-25 15:44:48,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-25 15:44:48,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:44:48,113 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-02-25 15:44:48,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:48,269 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-25 15:44:48,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-25 15:44:48,270 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-02-25 15:44:48,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:48,270 INFO L225 Difference]: With dead ends: 100 [2019-02-25 15:44:48,270 INFO L226 Difference]: Without dead ends: 98 [2019-02-25 15:44:48,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:44:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-25 15:44:48,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-02-25 15:44:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-25 15:44:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-02-25 15:44:48,274 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-02-25 15:44:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:48,274 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-02-25 15:44:48,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-25 15:44:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-02-25 15:44:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-25 15:44:48,275 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:48,275 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-02-25 15:44:48,275 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:48,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:48,275 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-02-25 15:44:48,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:48,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:48,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:44:48,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:48,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:51,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:51,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:51,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:51,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:51,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:51,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:51,632 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:44:51,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:44:51,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:44:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:51,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 96 conjunts are in the unsatisfiable core [2019-02-25 15:44:51,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:44:51,719 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:45:01,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:01,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:45:01,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-25 15:45:01,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:45:01,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-25 15:45:01,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-25 15:45:01,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:45:01,825 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-02-25 15:45:01,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:45:01,985 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-02-25 15:45:01,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-25 15:45:01,985 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-02-25 15:45:01,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:45:01,986 INFO L225 Difference]: With dead ends: 101 [2019-02-25 15:45:01,986 INFO L226 Difference]: Without dead ends: 99 [2019-02-25 15:45:01,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:45:01,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-25 15:45:01,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-25 15:45:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-25 15:45:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-02-25 15:45:01,990 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-02-25 15:45:01,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:45:01,991 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-02-25 15:45:01,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-25 15:45:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-02-25 15:45:01,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-25 15:45:01,991 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:45:01,992 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-02-25 15:45:01,992 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:45:01,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:45:01,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-02-25 15:45:01,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:45:01,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:01,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:45:01,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:01,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:45:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:05,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:05,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:45:05,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:45:05,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:45:05,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:05,520 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:45:05,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:45:05,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:45:07,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-25 15:45:07,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:45:07,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-25 15:45:07,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:45:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:07,124 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:45:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:17,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:45:17,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-25 15:45:17,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:45:17,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-25 15:45:17,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-25 15:45:17,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:45:17,011 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-02-25 15:45:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:45:17,171 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-25 15:45:17,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-25 15:45:17,171 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-02-25 15:45:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:45:17,172 INFO L225 Difference]: With dead ends: 102 [2019-02-25 15:45:17,172 INFO L226 Difference]: Without dead ends: 100 [2019-02-25 15:45:17,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:45:17,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-25 15:45:17,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-02-25 15:45:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-25 15:45:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-25 15:45:17,178 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-02-25 15:45:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:45:17,178 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-25 15:45:17,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-25 15:45:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-25 15:45:17,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-25 15:45:17,179 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:45:17,179 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-02-25 15:45:17,179 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:45:17,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:45:17,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-02-25 15:45:17,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:45:17,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:17,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:45:17,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:17,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:45:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:20,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:20,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:45:20,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:45:20,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:45:20,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:20,745 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:45:20,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:45:20,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:45:20,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:45:20,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:45:20,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 98 conjunts are in the unsatisfiable core [2019-02-25 15:45:20,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:45:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:20,837 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:45:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:31,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:45:31,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-25 15:45:31,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:45:31,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-25 15:45:31,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-25 15:45:31,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:45:31,120 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-02-25 15:45:31,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:45:31,349 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-02-25 15:45:31,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-25 15:45:31,350 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-02-25 15:45:31,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:45:31,350 INFO L225 Difference]: With dead ends: 103 [2019-02-25 15:45:31,350 INFO L226 Difference]: Without dead ends: 101 [2019-02-25 15:45:31,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:45:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-25 15:45:31,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-25 15:45:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-25 15:45:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-25 15:45:31,355 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-02-25 15:45:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:45:31,355 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-25 15:45:31,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-25 15:45:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-25 15:45:31,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-25 15:45:31,355 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:45:31,355 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-02-25 15:45:31,355 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:45:31,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:45:31,356 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-02-25 15:45:31,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:45:31,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:31,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:45:31,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:31,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:45:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:35,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:35,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:45:35,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:45:35,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:45:35,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:35,058 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:45:35,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:45:35,066 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:45:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:35,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 99 conjunts are in the unsatisfiable core [2019-02-25 15:45:35,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:45:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:35,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:45:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:45,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:45:45,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-25 15:45:45,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:45:45,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-25 15:45:45,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-25 15:45:45,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 15:45:45,717 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-02-25 15:45:46,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:45:46,022 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-02-25 15:45:46,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-25 15:45:46,023 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-02-25 15:45:46,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:45:46,023 INFO L225 Difference]: With dead ends: 104 [2019-02-25 15:45:46,023 INFO L226 Difference]: Without dead ends: 102 [2019-02-25 15:45:46,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 15:45:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-02-25 15:45:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-02-25 15:45:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-25 15:45:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-02-25 15:45:46,027 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-02-25 15:45:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:45:46,027 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-02-25 15:45:46,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-25 15:45:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-02-25 15:45:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-02-25 15:45:46,028 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:45:46,028 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-02-25 15:45:46,028 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:45:46,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:45:46,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-02-25 15:45:46,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:45:46,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:46,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:45:46,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:46,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:45:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:49,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:49,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:45:49,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:45:49,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:45:49,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:49,488 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:45:49,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:45:49,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:45:51,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-25 15:45:51,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:45:51,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-25 15:45:51,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:45:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:45:51,175 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:46:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:01,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:46:01,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-25 15:46:01,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:46:01,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-25 15:46:01,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-25 15:46:01,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 15:46:01,823 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-02-25 15:46:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:46:02,070 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-02-25 15:46:02,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-25 15:46:02,071 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-02-25 15:46:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:46:02,071 INFO L225 Difference]: With dead ends: 105 [2019-02-25 15:46:02,072 INFO L226 Difference]: Without dead ends: 103 [2019-02-25 15:46:02,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 15:46:02,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-25 15:46:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-25 15:46:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-25 15:46:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-02-25 15:46:02,076 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-02-25 15:46:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:46:02,076 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-02-25 15:46:02,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-25 15:46:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-02-25 15:46:02,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-25 15:46:02,077 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:46:02,077 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-02-25 15:46:02,077 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:46:02,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:46:02,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-02-25 15:46:02,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:46:02,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:02,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:46:02,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:02,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:46:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:06,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:06,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:46:06,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:46:06,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:46:06,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:06,014 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:46:06,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:46:06,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:46:06,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:46:06,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:46:06,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 101 conjunts are in the unsatisfiable core [2019-02-25 15:46:06,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:46:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:06,105 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:46:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:16,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:46:16,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-25 15:46:16,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:46:16,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-25 15:46:16,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-25 15:46:16,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 15:46:16,962 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-02-25 15:46:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:46:17,230 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-02-25 15:46:17,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-25 15:46:17,231 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-02-25 15:46:17,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:46:17,231 INFO L225 Difference]: With dead ends: 106 [2019-02-25 15:46:17,232 INFO L226 Difference]: Without dead ends: 104 [2019-02-25 15:46:17,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 15:46:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-25 15:46:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-02-25 15:46:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-25 15:46:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-02-25 15:46:17,237 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-02-25 15:46:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:46:17,237 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-02-25 15:46:17,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-25 15:46:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-02-25 15:46:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-25 15:46:17,238 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:46:17,238 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-02-25 15:46:17,238 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:46:17,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:46:17,239 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-02-25 15:46:17,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:46:17,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:17,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:46:17,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:17,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:46:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:21,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:21,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:46:21,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:46:21,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:46:21,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:21,078 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:46:21,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:46:21,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:46:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:21,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 102 conjunts are in the unsatisfiable core [2019-02-25 15:46:21,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:46:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:21,172 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:46:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:32,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:46:32,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-25 15:46:32,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:46:32,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-25 15:46:32,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-25 15:46:32,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-25 15:46:32,586 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-02-25 15:46:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:46:32,772 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-02-25 15:46:32,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-25 15:46:32,772 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-02-25 15:46:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:46:32,773 INFO L225 Difference]: With dead ends: 107 [2019-02-25 15:46:32,774 INFO L226 Difference]: Without dead ends: 105 [2019-02-25 15:46:32,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-25 15:46:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-25 15:46:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-25 15:46:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-25 15:46:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-02-25 15:46:32,779 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-02-25 15:46:32,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:46:32,779 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-02-25 15:46:32,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-25 15:46:32,779 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-02-25 15:46:32,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-25 15:46:32,780 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:46:32,780 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-02-25 15:46:32,780 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:46:32,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:46:32,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-02-25 15:46:32,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:46:32,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:32,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:46:32,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:32,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:46:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:36,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:36,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:46:36,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:46:36,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:46:36,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:36,807 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:46:36,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:46:36,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:46:38,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-25 15:46:38,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:46:38,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-25 15:46:38,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:46:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:38,774 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:46:50,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:50,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:46:50,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-25 15:46:50,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:46:50,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-25 15:46:50,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-25 15:46:50,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-25 15:46:50,190 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-02-25 15:46:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:46:50,540 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-25 15:46:50,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-25 15:46:50,547 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-02-25 15:46:50,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:46:50,548 INFO L225 Difference]: With dead ends: 108 [2019-02-25 15:46:50,548 INFO L226 Difference]: Without dead ends: 106 [2019-02-25 15:46:50,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-25 15:46:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-25 15:46:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-02-25 15:46:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-25 15:46:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-25 15:46:50,553 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-02-25 15:46:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:46:50,553 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-25 15:46:50,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-25 15:46:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-25 15:46:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-25 15:46:50,554 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:46:50,554 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-02-25 15:46:50,554 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:46:50,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:46:50,555 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-02-25 15:46:50,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:46:50,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:50,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:46:50,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:50,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:46:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:54,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:54,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:46:54,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:46:54,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:46:54,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:54,631 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:46:54,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:46:54,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:46:54,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:46:54,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:46:54,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 104 conjunts are in the unsatisfiable core [2019-02-25 15:46:54,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:46:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:46:54,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:47:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:06,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:47:06,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-25 15:47:06,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:47:06,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-25 15:47:06,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-25 15:47:06,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-25 15:47:06,302 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-02-25 15:47:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:47:06,609 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-02-25 15:47:06,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-25 15:47:06,609 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-02-25 15:47:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:47:06,610 INFO L225 Difference]: With dead ends: 109 [2019-02-25 15:47:06,610 INFO L226 Difference]: Without dead ends: 107 [2019-02-25 15:47:06,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-25 15:47:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-25 15:47:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-25 15:47:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-25 15:47:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-02-25 15:47:06,614 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-02-25 15:47:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:47:06,614 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-02-25 15:47:06,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-25 15:47:06,614 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-02-25 15:47:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-25 15:47:06,615 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:47:06,615 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-02-25 15:47:06,615 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:47:06,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:47:06,616 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-02-25 15:47:06,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:47:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:06,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:47:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:06,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:47:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:10,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:10,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:47:10,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:47:10,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:47:10,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:10,661 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:47:10,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:47:10,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:47:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:10,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 105 conjunts are in the unsatisfiable core [2019-02-25 15:47:10,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:47:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:10,755 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:47:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:22,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:47:22,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-25 15:47:22,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:47:22,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-25 15:47:22,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-25 15:47:22,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-25 15:47:22,536 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-02-25 15:47:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:47:22,771 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-25 15:47:22,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-25 15:47:22,771 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-02-25 15:47:22,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:47:22,771 INFO L225 Difference]: With dead ends: 110 [2019-02-25 15:47:22,771 INFO L226 Difference]: Without dead ends: 108 [2019-02-25 15:47:22,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-25 15:47:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-25 15:47:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-02-25 15:47:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-25 15:47:22,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-02-25 15:47:22,776 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-02-25 15:47:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:47:22,777 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-02-25 15:47:22,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-25 15:47:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-02-25 15:47:22,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-25 15:47:22,777 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:47:22,777 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-02-25 15:47:22,777 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:47:22,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:47:22,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-02-25 15:47:22,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:47:22,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:22,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:47:22,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:22,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:47:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:26,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:26,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:47:26,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:47:26,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:47:26,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:26,675 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:47:26,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:47:26,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:47:28,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-25 15:47:28,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:47:28,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-25 15:47:28,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:47:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:28,806 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:47:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:40,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:47:40,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-02-25 15:47:40,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:47:40,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-25 15:47:40,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-25 15:47:40,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-25 15:47:40,729 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-02-25 15:47:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:47:40,986 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-25 15:47:40,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-25 15:47:40,987 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-02-25 15:47:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:47:40,987 INFO L225 Difference]: With dead ends: 111 [2019-02-25 15:47:40,987 INFO L226 Difference]: Without dead ends: 109 [2019-02-25 15:47:40,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-25 15:47:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-25 15:47:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-25 15:47:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-25 15:47:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-25 15:47:40,992 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-02-25 15:47:40,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:47:40,992 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-25 15:47:40,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-25 15:47:40,992 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-25 15:47:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-25 15:47:40,992 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:47:40,993 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-02-25 15:47:40,993 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:47:40,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:47:40,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-02-25 15:47:40,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:47:40,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:40,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:47:40,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:40,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:47:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:45,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:45,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:47:45,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:47:45,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:47:45,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:45,317 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:47:45,326 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:47:45,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:47:45,393 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:47:45,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:47:45,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 107 conjunts are in the unsatisfiable core [2019-02-25 15:47:45,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:47:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:45,415 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:47:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:47:57,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:47:57,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-02-25 15:47:57,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:47:57,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-25 15:47:57,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-25 15:47:57,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-02-25 15:47:57,869 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-02-25 15:47:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:47:58,126 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-02-25 15:47:58,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-02-25 15:47:58,126 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-02-25 15:47:58,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:47:58,127 INFO L225 Difference]: With dead ends: 112 [2019-02-25 15:47:58,127 INFO L226 Difference]: Without dead ends: 110 [2019-02-25 15:47:58,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-02-25 15:47:58,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-25 15:47:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-02-25 15:47:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-02-25 15:47:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-02-25 15:47:58,130 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-02-25 15:47:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:47:58,130 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-02-25 15:47:58,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-25 15:47:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-02-25 15:47:58,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-02-25 15:47:58,131 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:47:58,131 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-02-25 15:47:58,131 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:47:58,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:47:58,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-02-25 15:47:58,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:47:58,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:58,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:47:58,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:58,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:47:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:48:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:48:02,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:02,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:48:02,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:48:02,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:48:02,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:02,234 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:48:02,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:48:02,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:48:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:48:02,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 108 conjunts are in the unsatisfiable core [2019-02-25 15:48:02,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:48:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:48:02,331 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:48:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:48:15,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:48:15,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-02-25 15:48:15,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:48:15,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-02-25 15:48:15,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-02-25 15:48:15,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-25 15:48:15,067 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-02-25 15:48:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:48:15,400 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-02-25 15:48:15,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-02-25 15:48:15,400 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-02-25 15:48:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:48:15,401 INFO L225 Difference]: With dead ends: 113 [2019-02-25 15:48:15,401 INFO L226 Difference]: Without dead ends: 111 [2019-02-25 15:48:15,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-25 15:48:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-25 15:48:15,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-25 15:48:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-25 15:48:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-02-25 15:48:15,407 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-02-25 15:48:15,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:48:15,407 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-02-25 15:48:15,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-02-25 15:48:15,407 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-02-25 15:48:15,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-25 15:48:15,408 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:48:15,408 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-02-25 15:48:15,408 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:48:15,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:48:15,409 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-02-25 15:48:15,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:48:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:15,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:48:15,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:15,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:48:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:48:19,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:48:19,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:19,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:48:19,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:48:19,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:48:19,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:19,724 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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:48:19,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:48:19,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:48:22,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-02-25 15:48:22,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:48:22,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 109 conjunts are in the unsatisfiable core [2019-02-25 15:48:22,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:48:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:48:22,160 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:48:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:48:35,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:48:35,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-02-25 15:48:35,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:48:35,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-25 15:48:35,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-25 15:48:35,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-25 15:48:35,154 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-02-25 15:48:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:48:35,481 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-25 15:48:35,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-02-25 15:48:35,481 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-02-25 15:48:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:48:35,482 INFO L225 Difference]: With dead ends: 114 [2019-02-25 15:48:35,482 INFO L226 Difference]: Without dead ends: 112 [2019-02-25 15:48:35,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-25 15:48:35,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-25 15:48:35,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-02-25 15:48:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-25 15:48:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-25 15:48:35,486 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-02-25 15:48:35,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:48:35,486 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-25 15:48:35,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-25 15:48:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-25 15:48:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-25 15:48:35,486 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:48:35,486 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-02-25 15:48:35,487 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:48:35,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:48:35,487 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-02-25 15:48:35,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:48:35,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:35,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:48:35,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:35,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:48:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:48:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:48:40,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:40,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:48:40,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:48:40,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:48:40,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:40,015 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 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:48:40,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:48:40,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:48:40,089 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:48:40,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:48:40,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 110 conjunts are in the unsatisfiable core [2019-02-25 15:48:40,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:48:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:48:40,115 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:48:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:48:53,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:48:53,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-02-25 15:48:53,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:48:53,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-25 15:48:53,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-25 15:48:53,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-25 15:48:53,204 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-02-25 15:48:53,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:48:53,474 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-25 15:48:53,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-25 15:48:53,475 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-02-25 15:48:53,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:48:53,475 INFO L225 Difference]: With dead ends: 115 [2019-02-25 15:48:53,475 INFO L226 Difference]: Without dead ends: 113 [2019-02-25 15:48:53,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-25 15:48:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-25 15:48:53,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-25 15:48:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-25 15:48:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-02-25 15:48:53,480 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-02-25 15:48:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:48:53,481 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-02-25 15:48:53,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-25 15:48:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-02-25 15:48:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-25 15:48:53,482 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:48:53,482 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-02-25 15:48:53,482 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:48:53,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:48:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-02-25 15:48:53,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:48:53,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:53,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:48:53,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:53,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:48:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:48:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:48:57,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:57,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:48:57,988 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:48:57,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:48:57,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:57,989 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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:48:57,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:48:57,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:48:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:48:58,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 111 conjunts are in the unsatisfiable core [2019-02-25 15:48:58,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:48:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:48:58,092 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:11,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:11,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-02-25 15:49:11,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:11,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-25 15:49:11,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-25 15:49:11,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-25 15:49:11,531 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-02-25 15:49:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:11,763 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-02-25 15:49:11,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-02-25 15:49:11,764 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-02-25 15:49:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:11,764 INFO L225 Difference]: With dead ends: 116 [2019-02-25 15:49:11,764 INFO L226 Difference]: Without dead ends: 114 [2019-02-25 15:49:11,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-25 15:49:11,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-25 15:49:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-02-25 15:49:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-25 15:49:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-02-25 15:49:11,770 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-02-25 15:49:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:11,770 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-02-25 15:49:11,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-25 15:49:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-02-25 15:49:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-02-25 15:49:11,771 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:11,771 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-02-25 15:49:11,772 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:11,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:11,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-02-25 15:49:11,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:11,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:11,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:11,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:11,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:16,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:16,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:16,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:16,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:16,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:16,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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:16,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:16,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:19,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-02-25 15:49:19,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:19,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 112 conjunts are in the unsatisfiable core [2019-02-25 15:49:19,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:19,037 INFO L322 TraceCheckSpWp]: Computing backward predicates...