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/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 14:13:33,318 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 14:13:33,320 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 14:13:33,333 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 14:13:33,333 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 14:13:33,335 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 14:13:33,336 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 14:13:33,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 14:13:33,340 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 14:13:33,341 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 14:13:33,342 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 14:13:33,342 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 14:13:33,343 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 14:13:33,344 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 14:13:33,345 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 14:13:33,346 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 14:13:33,347 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 14:13:33,349 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 14:13:33,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 14:13:33,353 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 14:13:33,354 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 14:13:33,356 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 14:13:33,359 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 14:13:33,359 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 14:13:33,359 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 14:13:33,361 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 14:13:33,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 14:13:33,363 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 14:13:33,363 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 14:13:33,365 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 14:13:33,365 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 14:13:33,366 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 14:13:33,366 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 14:13:33,366 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 14:13:33,368 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 14:13:33,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 14:13:33,369 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-24 14:13:33,382 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 14:13:33,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 14:13:33,384 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 14:13:33,384 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 14:13:33,384 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 14:13:33,384 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 14:13:33,384 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 14:13:33,385 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 14:13:33,385 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 14:13:33,385 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-24 14:13:33,385 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-24 14:13:33,385 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 14:13:33,386 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 14:13:33,386 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 14:13:33,387 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 14:13:33,387 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 14:13:33,387 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 14:13:33,387 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 14:13:33,387 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 14:13:33,388 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 14:13:33,388 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 14:13:33,388 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 14:13:33,388 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 14:13:33,388 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 14:13:33,389 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 14:13:33,389 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 14:13:33,389 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 14:13:33,389 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 14:13:33,390 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 14:13:33,390 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 14:13:33,390 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:13:33,390 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 14:13:33,390 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 14:13:33,391 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 14:13:33,391 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 14:13:33,391 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 14:13:33,391 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 14:13:33,391 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 14:13:33,392 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 14:13:33,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 14:13:33,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 14:13:33,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 14:13:33,451 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 14:13:33,452 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 14:13:33,453 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2018-12-24 14:13:33,453 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2018-12-24 14:13:33,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 14:13:33,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 14:13:33,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 14:13:33,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 14:13:33,502 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 14:13:33,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 14:13:33,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 14:13:33,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 14:13:33,543 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 14:13:33,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... [2018-12-24 14:13:33,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 14:13:33,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 14:13:33,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 14:13:33,566 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 14:13:33,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:13:33,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-24 14:13:33,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-24 14:13:33,901 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-24 14:13:33,901 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-24 14:13:33,904 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:13:33 BoogieIcfgContainer [2018-12-24 14:13:33,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 14:13:33,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 14:13:33,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 14:13:33,908 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 14:13:33,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:13:33" (1/2) ... [2018-12-24 14:13:33,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392a1229 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:13:33, skipping insertion in model container [2018-12-24 14:13:33,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:13:33" (2/2) ... [2018-12-24 14:13:33,912 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2018-12-24 14:13:33,925 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 14:13:33,933 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-24 14:13:33,950 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-24 14:13:33,981 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 14:13:33,982 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 14:13:33,982 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 14:13:33,982 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 14:13:33,982 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 14:13:33,983 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 14:13:33,983 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 14:13:33,983 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 14:13:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-24 14:13:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 14:13:34,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:34,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 14:13:34,007 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:34,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:34,014 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-24 14:13:34,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:34,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:34,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:34,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:34,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:13:34,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:13:34,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-24 14:13:34,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:13:34,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 14:13:34,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 14:13:34,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:13:34,177 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-24 14:13:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:34,284 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-24 14:13:34,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 14:13:34,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-24 14:13:34,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:34,313 INFO L225 Difference]: With dead ends: 12 [2018-12-24 14:13:34,313 INFO L226 Difference]: Without dead ends: 7 [2018-12-24 14:13:34,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:13:34,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-24 14:13:34,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-24 14:13:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-24 14:13:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-24 14:13:34,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-12-24 14:13:34,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:34,377 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-24 14:13:34,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 14:13:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-24 14:13:34,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:13:34,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:34,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 14:13:34,379 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:34,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:34,379 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2018-12-24 14:13:34,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:34,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:34,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:34,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:34,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:13:34,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:34,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:34,487 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 14:13:34,489 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2018-12-24 14:13:34,555 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:13:34,555 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:13:37,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:13:37,135 INFO L272 AbstractInterpreter]: Visited 6 different actions 34 times. Merged at 2 different actions 14 times. Widened at 2 different actions 6 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 14:13:37,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:37,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:13:37,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:37,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:37,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:37,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:37,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:13:37,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:13:37,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:37,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-24 14:13:37,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:37,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 14:13:37,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 14:13:37,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-24 14:13:37,575 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-24 14:13:37,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:37,737 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-24 14:13:37,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 14:13:37,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-24 14:13:37,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:37,738 INFO L225 Difference]: With dead ends: 13 [2018-12-24 14:13:37,739 INFO L226 Difference]: Without dead ends: 9 [2018-12-24 14:13:37,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-24 14:13:37,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-24 14:13:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-24 14:13:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-24 14:13:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-24 14:13:37,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-24 14:13:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:37,745 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-24 14:13:37,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 14:13:37,747 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-24 14:13:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 14:13:37,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:37,748 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-24 14:13:37,748 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:37,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:37,749 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2018-12-24 14:13:37,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:37,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:37,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:37,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:37,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:37,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 14:13:37,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:37,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:37,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:37,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:37,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:37,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:37,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:37,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:37,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-24 14:13:37,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:37,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 14:13:37,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 14:13:38,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:38,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-24 14:13:38,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:38,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-24 14:13:38,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-24 14:13:38,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:13:38,463 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-12-24 14:13:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:38,584 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-12-24 14:13:38,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 14:13:38,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-12-24 14:13:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:38,586 INFO L225 Difference]: With dead ends: 16 [2018-12-24 14:13:38,586 INFO L226 Difference]: Without dead ends: 11 [2018-12-24 14:13:38,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:13:38,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-24 14:13:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-24 14:13:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-24 14:13:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-24 14:13:38,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-12-24 14:13:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:38,590 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-24 14:13:38,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-24 14:13:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-24 14:13:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-24 14:13:38,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:38,592 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2018-12-24 14:13:38,592 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:38,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:38,593 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2018-12-24 14:13:38,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:38,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:38,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:38,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:38,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-24 14:13:38,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:38,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:38,735 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:38,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:38,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:38,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:38,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:13:38,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:13:38,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:13:38,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:38,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-24 14:13:38,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-24 14:13:38,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:38,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-24 14:13:38,973 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:38,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 14:13:38,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 14:13:38,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-24 14:13:38,975 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-12-24 14:13:39,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:39,115 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-12-24 14:13:39,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 14:13:39,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-24 14:13:39,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:39,117 INFO L225 Difference]: With dead ends: 19 [2018-12-24 14:13:39,117 INFO L226 Difference]: Without dead ends: 13 [2018-12-24 14:13:39,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-24 14:13:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-24 14:13:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-24 14:13:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 14:13:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-24 14:13:39,122 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-12-24 14:13:39,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:39,122 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-24 14:13:39,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 14:13:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-24 14:13:39,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-24 14:13:39,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:39,123 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2018-12-24 14:13:39,123 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:39,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2018-12-24 14:13:39,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:39,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:39,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:39,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:39,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-24 14:13:39,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:39,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:39,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:39,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:39,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:39,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:39,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:39,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:39,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-24 14:13:39,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-24 14:13:39,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:39,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-24 14:13:39,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:39,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 14:13:39,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 14:13:39,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-24 14:13:39,638 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-12-24 14:13:39,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:39,777 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-12-24 14:13:39,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 14:13:39,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-24 14:13:39,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:39,778 INFO L225 Difference]: With dead ends: 22 [2018-12-24 14:13:39,779 INFO L226 Difference]: Without dead ends: 15 [2018-12-24 14:13:39,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-24 14:13:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-24 14:13:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-24 14:13:39,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-24 14:13:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-24 14:13:39,782 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-24 14:13:39,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:39,783 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-24 14:13:39,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 14:13:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-24 14:13:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-24 14:13:39,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:39,784 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2018-12-24 14:13:39,784 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:39,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:39,785 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2018-12-24 14:13:39,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:39,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:39,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:39,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:39,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-24 14:13:40,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:40,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:40,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:40,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:40,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:40,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:40,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:40,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:40,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-24 14:13:40,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:40,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-24 14:13:40,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-24 14:13:40,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:40,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-24 14:13:40,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:40,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:13:40,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:13:40,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:13:40,504 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-12-24 14:13:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:40,548 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-12-24 14:13:40,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:13:40,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-24 14:13:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:40,550 INFO L225 Difference]: With dead ends: 25 [2018-12-24 14:13:40,550 INFO L226 Difference]: Without dead ends: 17 [2018-12-24 14:13:40,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:13:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-24 14:13:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-24 14:13:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-24 14:13:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-24 14:13:40,554 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-12-24 14:13:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:40,555 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-24 14:13:40,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:13:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-24 14:13:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-24 14:13:40,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:40,556 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2018-12-24 14:13:40,556 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:40,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:40,556 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2018-12-24 14:13:40,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:40,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:40,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:40,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:40,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-24 14:13:40,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:40,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:40,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:40,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:40,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:40,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:40,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:13:40,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:13:40,750 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:13:40,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:40,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-24 14:13:40,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-24 14:13:40,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:40,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-24 14:13:40,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:40,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 14:13:40,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 14:13:40,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:13:40,943 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2018-12-24 14:13:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:40,988 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-24 14:13:40,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:13:40,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-24 14:13:40,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:40,990 INFO L225 Difference]: With dead ends: 28 [2018-12-24 14:13:40,990 INFO L226 Difference]: Without dead ends: 19 [2018-12-24 14:13:40,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-24 14:13:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-24 14:13:40,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-24 14:13:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-24 14:13:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-24 14:13:40,994 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-12-24 14:13:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:40,994 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-24 14:13:40,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 14:13:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-24 14:13:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-24 14:13:40,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:40,995 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2018-12-24 14:13:40,995 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:40,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2018-12-24 14:13:40,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:40,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:40,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:40,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:40,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-24 14:13:41,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:41,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:41,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:41,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:41,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:41,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:41,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:41,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:41,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-24 14:13:41,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-24 14:13:41,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:41,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-24 14:13:41,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:41,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:13:41,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:13:41,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-24 14:13:41,343 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-12-24 14:13:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:41,462 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-24 14:13:41,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:13:41,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-24 14:13:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:41,470 INFO L225 Difference]: With dead ends: 31 [2018-12-24 14:13:41,470 INFO L226 Difference]: Without dead ends: 21 [2018-12-24 14:13:41,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-24 14:13:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-24 14:13:41,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-24 14:13:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-24 14:13:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-24 14:13:41,478 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-24 14:13:41,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:41,478 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-24 14:13:41,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:13:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-24 14:13:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-24 14:13:41,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:41,480 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2018-12-24 14:13:41,480 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:41,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:41,480 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2018-12-24 14:13:41,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:41,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:41,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:41,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:41,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-24 14:13:41,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:41,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:41,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:41,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:41,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:41,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:41,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:41,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:41,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-24 14:13:41,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:41,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-24 14:13:41,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-24 14:13:42,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:42,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-24 14:13:42,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:42,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 14:13:42,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 14:13:42,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-24 14:13:42,122 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2018-12-24 14:13:42,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:42,293 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-12-24 14:13:42,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-24 14:13:42,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-24 14:13:42,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:42,294 INFO L225 Difference]: With dead ends: 34 [2018-12-24 14:13:42,295 INFO L226 Difference]: Without dead ends: 23 [2018-12-24 14:13:42,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-24 14:13:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-24 14:13:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-24 14:13:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-24 14:13:42,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-24 14:13:42,303 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-24 14:13:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:42,304 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-24 14:13:42,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 14:13:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-24 14:13:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-24 14:13:42,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:42,305 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2018-12-24 14:13:42,305 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:42,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:42,305 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2018-12-24 14:13:42,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:42,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:42,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:42,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:42,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-24 14:13:42,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:42,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:42,514 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:42,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:42,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:42,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:42,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:13:42,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:13:42,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:13:42,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:42,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-24 14:13:42,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-24 14:13:42,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:42,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-24 14:13:42,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:42,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 14:13:42,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 14:13:42,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-24 14:13:42,825 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-12-24 14:13:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:42,890 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-24 14:13:42,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-24 14:13:42,890 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-24 14:13:42,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:42,891 INFO L225 Difference]: With dead ends: 37 [2018-12-24 14:13:42,892 INFO L226 Difference]: Without dead ends: 25 [2018-12-24 14:13:42,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-24 14:13:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-24 14:13:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-24 14:13:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-24 14:13:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-24 14:13:42,898 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-12-24 14:13:42,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:42,898 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-24 14:13:42,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 14:13:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-24 14:13:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-24 14:13:42,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:42,899 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2018-12-24 14:13:42,899 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:42,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:42,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2018-12-24 14:13:42,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:42,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:42,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:42,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:42,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-24 14:13:43,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:43,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:43,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:43,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:43,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:43,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:43,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:43,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:43,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-24 14:13:43,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-24 14:13:43,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:43,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-24 14:13:43,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:43,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 14:13:43,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 14:13:43,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-24 14:13:43,469 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-12-24 14:13:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:43,524 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-12-24 14:13:43,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-24 14:13:43,527 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-24 14:13:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:43,528 INFO L225 Difference]: With dead ends: 40 [2018-12-24 14:13:43,528 INFO L226 Difference]: Without dead ends: 27 [2018-12-24 14:13:43,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-24 14:13:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-24 14:13:43,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-24 14:13:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-24 14:13:43,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-24 14:13:43,533 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-24 14:13:43,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:43,533 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-24 14:13:43,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 14:13:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-24 14:13:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-24 14:13:43,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:43,534 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2018-12-24 14:13:43,534 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:43,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:43,535 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2018-12-24 14:13:43,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:43,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:43,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:43,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:43,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-24 14:13:43,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:43,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:43,747 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:43,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:43,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:43,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:43,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:43,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:43,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-24 14:13:43,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:43,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-24 14:13:43,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-24 14:13:44,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:44,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-24 14:13:44,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:44,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 14:13:44,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 14:13:44,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-24 14:13:44,164 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-12-24 14:13:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:44,237 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-12-24 14:13:44,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-24 14:13:44,238 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-12-24 14:13:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:44,239 INFO L225 Difference]: With dead ends: 43 [2018-12-24 14:13:44,239 INFO L226 Difference]: Without dead ends: 29 [2018-12-24 14:13:44,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-24 14:13:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-24 14:13:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-24 14:13:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-24 14:13:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-24 14:13:44,246 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-12-24 14:13:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:44,246 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-24 14:13:44,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 14:13:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-24 14:13:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-24 14:13:44,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:44,247 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2018-12-24 14:13:44,248 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:44,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:44,248 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2018-12-24 14:13:44,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:44,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:44,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:44,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:44,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-24 14:13:44,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:44,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:44,653 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:44,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:44,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:44,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:44,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:13:44,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:13:44,689 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:13:44,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:44,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-24 14:13:44,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-24 14:13:45,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:45,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-24 14:13:45,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:45,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-24 14:13:45,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-24 14:13:45,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-24 14:13:45,065 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2018-12-24 14:13:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:45,170 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-12-24 14:13:45,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-24 14:13:45,170 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-12-24 14:13:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:45,171 INFO L225 Difference]: With dead ends: 46 [2018-12-24 14:13:45,172 INFO L226 Difference]: Without dead ends: 31 [2018-12-24 14:13:45,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-24 14:13:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-24 14:13:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-24 14:13:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-24 14:13:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-24 14:13:45,177 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-12-24 14:13:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:45,178 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-24 14:13:45,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-24 14:13:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-24 14:13:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-24 14:13:45,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:45,179 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2018-12-24 14:13:45,179 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:45,180 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2018-12-24 14:13:45,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:45,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:45,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:45,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:45,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-24 14:13:45,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:45,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:45,396 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:45,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:45,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:45,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:45,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:45,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:45,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-24 14:13:45,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-24 14:13:45,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:45,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-24 14:13:45,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:45,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-24 14:13:45,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-24 14:13:45,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-24 14:13:45,909 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-12-24 14:13:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:45,979 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-12-24 14:13:45,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-24 14:13:45,980 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-24 14:13:45,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:45,981 INFO L225 Difference]: With dead ends: 49 [2018-12-24 14:13:45,981 INFO L226 Difference]: Without dead ends: 33 [2018-12-24 14:13:45,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-24 14:13:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-24 14:13:45,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-24 14:13:45,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-24 14:13:45,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-24 14:13:45,987 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-12-24 14:13:45,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:45,987 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-24 14:13:45,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-24 14:13:45,988 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-24 14:13:45,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-24 14:13:45,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:45,989 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2018-12-24 14:13:45,989 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:45,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:45,989 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2018-12-24 14:13:45,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:45,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:45,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:45,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:45,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-24 14:13:46,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:46,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:46,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:46,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:46,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:46,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:46,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:46,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:46,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-24 14:13:46,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:46,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-24 14:13:46,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:46,949 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-24 14:13:46,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:46,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-24 14:13:46,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:46,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-24 14:13:46,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-24 14:13:46,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-24 14:13:46,971 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2018-12-24 14:13:47,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:47,142 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-12-24 14:13:47,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-24 14:13:47,143 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-24 14:13:47,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:47,144 INFO L225 Difference]: With dead ends: 52 [2018-12-24 14:13:47,144 INFO L226 Difference]: Without dead ends: 35 [2018-12-24 14:13:47,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-24 14:13:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-24 14:13:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-24 14:13:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-24 14:13:47,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-24 14:13:47,148 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-24 14:13:47,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:47,148 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-24 14:13:47,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-24 14:13:47,149 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-24 14:13:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-24 14:13:47,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:47,150 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2018-12-24 14:13:47,150 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:47,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:47,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2018-12-24 14:13:47,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:47,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:47,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:47,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:47,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-24 14:13:47,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:47,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:47,400 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:47,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:47,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:47,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:47,410 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:13:47,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:13:47,432 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:13:47,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:47,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-24 14:13:47,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-24 14:13:47,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:47,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-24 14:13:47,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:47,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-24 14:13:47,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-24 14:13:47,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-24 14:13:47,799 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-12-24 14:13:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:47,920 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-12-24 14:13:47,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-24 14:13:47,921 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-12-24 14:13:47,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:47,922 INFO L225 Difference]: With dead ends: 55 [2018-12-24 14:13:47,922 INFO L226 Difference]: Without dead ends: 37 [2018-12-24 14:13:47,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-24 14:13:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-24 14:13:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-24 14:13:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-24 14:13:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-24 14:13:47,928 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-24 14:13:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:47,928 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-24 14:13:47,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-24 14:13:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-24 14:13:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-24 14:13:47,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:47,929 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2018-12-24 14:13:47,929 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:47,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:47,930 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2018-12-24 14:13:47,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:47,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:47,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:47,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:47,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-24 14:13:48,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:48,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:48,662 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:48,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:48,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:48,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:48,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:48,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:48,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-24 14:13:48,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-24 14:13:49,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:49,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-24 14:13:49,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:49,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-24 14:13:49,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-24 14:13:49,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-24 14:13:49,436 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2018-12-24 14:13:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:49,499 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-12-24 14:13:49,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-24 14:13:49,500 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-24 14:13:49,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:49,500 INFO L225 Difference]: With dead ends: 58 [2018-12-24 14:13:49,501 INFO L226 Difference]: Without dead ends: 39 [2018-12-24 14:13:49,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-24 14:13:49,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-24 14:13:49,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-24 14:13:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-24 14:13:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-24 14:13:49,507 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-24 14:13:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:49,507 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-24 14:13:49,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-24 14:13:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-24 14:13:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-24 14:13:49,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:49,508 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2018-12-24 14:13:49,508 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:49,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:49,509 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2018-12-24 14:13:49,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:49,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:49,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:49,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:49,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-24 14:13:49,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:49,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:49,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:49,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:49,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:49,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:49,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:49,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:49,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-24 14:13:49,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:49,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-24 14:13:49,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:50,629 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-24 14:13:50,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:50,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-24 14:13:50,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:50,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-24 14:13:50,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-24 14:13:50,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 14:13:50,652 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2018-12-24 14:13:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:50,726 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-12-24 14:13:50,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-24 14:13:50,726 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-12-24 14:13:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:50,727 INFO L225 Difference]: With dead ends: 61 [2018-12-24 14:13:50,727 INFO L226 Difference]: Without dead ends: 41 [2018-12-24 14:13:50,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 14:13:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-24 14:13:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-24 14:13:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-24 14:13:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-24 14:13:50,733 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-12-24 14:13:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:50,733 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-24 14:13:50,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-24 14:13:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-24 14:13:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-24 14:13:50,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:50,734 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2018-12-24 14:13:50,735 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:50,735 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2018-12-24 14:13:50,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:50,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:50,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:50,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:50,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-24 14:13:51,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:51,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:51,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:51,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:51,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:51,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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:51,530 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:13:51,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:13:51,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:13:51,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:51,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-24 14:13:51,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-24 14:13:52,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:52,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-24 14:13:52,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:52,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-24 14:13:52,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-24 14:13:52,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-24 14:13:52,445 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2018-12-24 14:13:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:52,630 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-24 14:13:52,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-24 14:13:52,630 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-12-24 14:13:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:52,631 INFO L225 Difference]: With dead ends: 64 [2018-12-24 14:13:52,631 INFO L226 Difference]: Without dead ends: 43 [2018-12-24 14:13:52,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-24 14:13:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-24 14:13:52,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-24 14:13:52,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-24 14:13:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-24 14:13:52,637 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-12-24 14:13:52,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:52,637 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-24 14:13:52,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-24 14:13:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-24 14:13:52,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-24 14:13:52,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:52,638 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2018-12-24 14:13:52,638 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:52,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:52,638 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2018-12-24 14:13:52,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:52,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:52,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:52,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:52,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-24 14:13:52,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:52,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:52,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:52,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:52,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:52,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:52,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:52,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:53,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:53,018 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-24 14:13:53,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-24 14:13:53,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:53,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-24 14:13:53,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:53,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-24 14:13:53,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-24 14:13:53,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-24 14:13:53,541 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2018-12-24 14:13:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:53,613 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-12-24 14:13:53,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-24 14:13:53,614 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-12-24 14:13:53,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:53,615 INFO L225 Difference]: With dead ends: 67 [2018-12-24 14:13:53,615 INFO L226 Difference]: Without dead ends: 45 [2018-12-24 14:13:53,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-24 14:13:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-24 14:13:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-24 14:13:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-24 14:13:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-24 14:13:53,622 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-24 14:13:53,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:53,623 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-24 14:13:53,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-24 14:13:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-24 14:13:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-24 14:13:53,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:53,624 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2018-12-24 14:13:53,624 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:53,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:53,625 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2018-12-24 14:13:53,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:53,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:53,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:53,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:53,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-24 14:13:54,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:54,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:54,040 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:54,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:54,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:54,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:54,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:54,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:54,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-24 14:13:54,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:54,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-24 14:13:54,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-24 14:13:54,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:54,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-24 14:13:54,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:54,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-24 14:13:54,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-24 14:13:54,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 14:13:54,679 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2018-12-24 14:13:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:54,757 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-24 14:13:54,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-24 14:13:54,758 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-12-24 14:13:54,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:54,759 INFO L225 Difference]: With dead ends: 70 [2018-12-24 14:13:54,759 INFO L226 Difference]: Without dead ends: 47 [2018-12-24 14:13:54,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 14:13:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-24 14:13:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-24 14:13:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-24 14:13:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-24 14:13:54,764 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-12-24 14:13:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:54,765 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-24 14:13:54,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-24 14:13:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-24 14:13:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-24 14:13:54,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:54,766 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2018-12-24 14:13:54,766 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:54,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:54,766 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2018-12-24 14:13:54,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:54,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:54,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:54,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:54,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:55,688 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-24 14:13:55,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:55,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:55,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:55,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:55,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:55,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:55,697 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:13:55,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:13:55,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:13:55,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:55,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-24 14:13:55,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-24 14:13:56,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:56,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-24 14:13:56,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:56,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-24 14:13:56,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-24 14:13:56,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-24 14:13:56,368 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2018-12-24 14:13:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:56,455 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-24 14:13:56,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-24 14:13:56,460 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-12-24 14:13:56,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:56,460 INFO L225 Difference]: With dead ends: 73 [2018-12-24 14:13:56,461 INFO L226 Difference]: Without dead ends: 49 [2018-12-24 14:13:56,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-24 14:13:56,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-24 14:13:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-24 14:13:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-24 14:13:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-24 14:13:56,465 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-12-24 14:13:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:56,466 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-24 14:13:56,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-24 14:13:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-24 14:13:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-24 14:13:56,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:56,467 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2018-12-24 14:13:56,467 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:56,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:56,467 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2018-12-24 14:13:56,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:56,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:56,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:56,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:56,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-24 14:13:56,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:56,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:56,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:56,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:56,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:56,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:56,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:56,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:13:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:56,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-24 14:13:56,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-24 14:13:57,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:57,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-24 14:13:57,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:57,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-24 14:13:57,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-24 14:13:57,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-24 14:13:57,743 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2018-12-24 14:13:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:57,893 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-12-24 14:13:57,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-24 14:13:57,896 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-12-24 14:13:57,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:57,897 INFO L225 Difference]: With dead ends: 76 [2018-12-24 14:13:57,897 INFO L226 Difference]: Without dead ends: 51 [2018-12-24 14:13:57,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-24 14:13:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-24 14:13:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-24 14:13:57,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-24 14:13:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-24 14:13:57,902 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-24 14:13:57,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:57,902 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-24 14:13:57,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-24 14:13:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-24 14:13:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-24 14:13:57,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:57,903 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2018-12-24 14:13:57,903 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:57,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2018-12-24 14:13:57,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:57,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:57,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:13:57,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:57,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:13:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-24 14:13:58,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:58,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:13:58,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:13:58,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:13:58,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:13:58,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:13:58,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:13:58,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:13:58,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-24 14:13:58,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:13:58,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:13:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-24 14:13:58,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:13:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-24 14:13:59,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:13:59,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-24 14:13:59,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:13:59,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-24 14:13:59,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-24 14:13:59,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 14:13:59,582 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2018-12-24 14:13:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:13:59,674 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-12-24 14:13:59,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-24 14:13:59,675 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-24 14:13:59,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:13:59,676 INFO L225 Difference]: With dead ends: 79 [2018-12-24 14:13:59,676 INFO L226 Difference]: Without dead ends: 53 [2018-12-24 14:13:59,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 14:13:59,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-24 14:13:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-24 14:13:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-24 14:13:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-24 14:13:59,681 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-12-24 14:13:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:13:59,681 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-24 14:13:59,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-24 14:13:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-24 14:13:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-24 14:13:59,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:13:59,682 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2018-12-24 14:13:59,682 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:13:59,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:13:59,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2018-12-24 14:13:59,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:13:59,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:59,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:13:59,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:13:59,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:13:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-24 14:14:00,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:00,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:00,334 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:00,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:00,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:00,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:00,353 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:00,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:00,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:00,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:00,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-24 14:14:00,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-24 14:14:01,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:01,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-24 14:14:01,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:01,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-24 14:14:01,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-24 14:14:01,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-24 14:14:01,139 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2018-12-24 14:14:01,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:01,245 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-12-24 14:14:01,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-24 14:14:01,246 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-12-24 14:14:01,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:01,246 INFO L225 Difference]: With dead ends: 82 [2018-12-24 14:14:01,247 INFO L226 Difference]: Without dead ends: 55 [2018-12-24 14:14:01,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-24 14:14:01,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-24 14:14:01,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-24 14:14:01,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-24 14:14:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-24 14:14:01,251 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-12-24 14:14:01,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:01,252 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-24 14:14:01,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-24 14:14:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-24 14:14:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-24 14:14:01,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:01,253 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2018-12-24 14:14:01,253 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:01,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:01,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2018-12-24 14:14:01,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:01,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:01,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-24 14:14:01,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:01,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:01,788 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:01,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:01,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:01,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:01,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:01,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:01,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-24 14:14:01,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-24 14:14:02,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:02,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-24 14:14:02,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:02,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-24 14:14:02,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-24 14:14:02,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-24 14:14:02,886 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2018-12-24 14:14:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:02,994 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-12-24 14:14:02,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-24 14:14:02,994 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-12-24 14:14:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:02,995 INFO L225 Difference]: With dead ends: 85 [2018-12-24 14:14:02,995 INFO L226 Difference]: Without dead ends: 57 [2018-12-24 14:14:02,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-24 14:14:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-24 14:14:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-24 14:14:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-24 14:14:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-24 14:14:03,001 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-12-24 14:14:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:03,002 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-24 14:14:03,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-24 14:14:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-24 14:14:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-24 14:14:03,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:03,003 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2018-12-24 14:14:03,003 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:03,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:03,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2018-12-24 14:14:03,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:03,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:03,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:03,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:03,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-24 14:14:03,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:03,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:03,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:03,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:03,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:03,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:03,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:03,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:03,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-24 14:14:03,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:03,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-24 14:14:03,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-24 14:14:04,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:04,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-24 14:14:04,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:04,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-24 14:14:04,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-24 14:14:04,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 14:14:04,844 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2018-12-24 14:14:04,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:04,939 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-12-24 14:14:04,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-24 14:14:04,940 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-12-24 14:14:04,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:04,940 INFO L225 Difference]: With dead ends: 88 [2018-12-24 14:14:04,940 INFO L226 Difference]: Without dead ends: 59 [2018-12-24 14:14:04,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 14:14:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-24 14:14:04,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-24 14:14:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-24 14:14:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-24 14:14:04,944 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-12-24 14:14:04,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:04,945 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-24 14:14:04,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-24 14:14:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-24 14:14:04,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-24 14:14:04,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:04,946 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2018-12-24 14:14:04,946 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:04,946 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2018-12-24 14:14:04,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:04,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:04,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:04,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:04,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:05,551 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-24 14:14:05,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:05,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:05,552 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:05,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:05,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:05,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:05,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:05,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:05,607 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:05,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:05,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-24 14:14:05,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-24 14:14:07,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:07,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-24 14:14:07,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:07,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-24 14:14:07,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-24 14:14:07,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-24 14:14:07,004 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2018-12-24 14:14:07,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:07,146 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-12-24 14:14:07,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-24 14:14:07,146 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-12-24 14:14:07,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:07,147 INFO L225 Difference]: With dead ends: 91 [2018-12-24 14:14:07,147 INFO L226 Difference]: Without dead ends: 61 [2018-12-24 14:14:07,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-24 14:14:07,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-24 14:14:07,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-24 14:14:07,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 14:14:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-24 14:14:07,151 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-12-24 14:14:07,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:07,151 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-24 14:14:07,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-24 14:14:07,151 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-24 14:14:07,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-24 14:14:07,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:07,152 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2018-12-24 14:14:07,152 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:07,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:07,153 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2018-12-24 14:14:07,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:07,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:07,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:07,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:07,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-24 14:14:07,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:07,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:07,631 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:07,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:07,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:07,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:07,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:07,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:07,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-24 14:14:07,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-24 14:14:08,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:08,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-24 14:14:08,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:08,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-24 14:14:08,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-24 14:14:08,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-24 14:14:08,766 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2018-12-24 14:14:08,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:08,900 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-12-24 14:14:08,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-24 14:14:08,901 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-12-24 14:14:08,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:08,902 INFO L225 Difference]: With dead ends: 94 [2018-12-24 14:14:08,902 INFO L226 Difference]: Without dead ends: 63 [2018-12-24 14:14:08,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-24 14:14:08,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-24 14:14:08,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-24 14:14:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-24 14:14:08,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-24 14:14:08,907 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-24 14:14:08,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:08,907 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-24 14:14:08,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-24 14:14:08,908 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-24 14:14:08,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-24 14:14:08,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:08,908 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2018-12-24 14:14:08,908 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:08,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:08,909 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2018-12-24 14:14:08,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:08,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:08,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:08,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:08,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-24 14:14:09,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:09,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:09,506 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:09,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:09,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:09,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:09,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:09,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:09,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-24 14:14:09,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:09,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-24 14:14:09,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-24 14:14:10,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:10,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-24 14:14:10,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:10,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-24 14:14:10,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-24 14:14:10,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 14:14:10,752 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2018-12-24 14:14:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:10,989 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-12-24 14:14:10,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-24 14:14:10,990 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-24 14:14:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:10,990 INFO L225 Difference]: With dead ends: 97 [2018-12-24 14:14:10,990 INFO L226 Difference]: Without dead ends: 65 [2018-12-24 14:14:10,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 14:14:10,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-24 14:14:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-24 14:14:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-24 14:14:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-24 14:14:10,994 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2018-12-24 14:14:10,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:10,994 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-24 14:14:10,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-24 14:14:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-24 14:14:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-24 14:14:10,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:10,995 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2018-12-24 14:14:10,995 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:10,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:10,995 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2018-12-24 14:14:10,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:10,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:10,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:10,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:10,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:11,554 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-24 14:14:11,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:11,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:11,555 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:11,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:11,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:11,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:11,571 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:11,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:11,618 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:11,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:11,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-24 14:14:11,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-24 14:14:12,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:12,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-24 14:14:12,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:12,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-24 14:14:12,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-24 14:14:12,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-24 14:14:12,901 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2018-12-24 14:14:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:13,065 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-12-24 14:14:13,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-24 14:14:13,065 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-12-24 14:14:13,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:13,066 INFO L225 Difference]: With dead ends: 100 [2018-12-24 14:14:13,066 INFO L226 Difference]: Without dead ends: 67 [2018-12-24 14:14:13,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-24 14:14:13,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-24 14:14:13,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-24 14:14:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-24 14:14:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-24 14:14:13,070 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-12-24 14:14:13,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:13,071 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-24 14:14:13,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-24 14:14:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-24 14:14:13,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-24 14:14:13,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:13,072 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2018-12-24 14:14:13,072 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:13,072 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2018-12-24 14:14:13,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:13,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:13,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:13,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:13,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-24 14:14:13,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:13,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:13,603 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:13,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:13,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:13,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:13,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:13,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:13,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-24 14:14:13,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-24 14:14:14,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:14,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-24 14:14:14,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:14,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-24 14:14:14,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-24 14:14:14,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-24 14:14:14,773 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2018-12-24 14:14:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:14,900 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2018-12-24 14:14:14,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-24 14:14:14,900 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-12-24 14:14:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:14,901 INFO L225 Difference]: With dead ends: 103 [2018-12-24 14:14:14,902 INFO L226 Difference]: Without dead ends: 69 [2018-12-24 14:14:14,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-24 14:14:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-24 14:14:14,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-24 14:14:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-24 14:14:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-24 14:14:14,905 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-12-24 14:14:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:14,905 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-24 14:14:14,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-24 14:14:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-24 14:14:14,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-24 14:14:14,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:14,906 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2018-12-24 14:14:14,906 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:14,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:14,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2018-12-24 14:14:14,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:14,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:14,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:14,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:14,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-24 14:14:15,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:15,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:15,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:15,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:15,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:15,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:15,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:15,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:16,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-24 14:14:16,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:16,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-24 14:14:16,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-24 14:14:17,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:17,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-24 14:14:17,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:17,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-24 14:14:17,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-24 14:14:17,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 14:14:17,391 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2018-12-24 14:14:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:17,587 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-12-24 14:14:17,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-24 14:14:17,587 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-12-24 14:14:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:17,587 INFO L225 Difference]: With dead ends: 106 [2018-12-24 14:14:17,588 INFO L226 Difference]: Without dead ends: 71 [2018-12-24 14:14:17,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 14:14:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-24 14:14:17,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-24 14:14:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-24 14:14:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-12-24 14:14:17,592 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-12-24 14:14:17,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:17,592 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-12-24 14:14:17,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-24 14:14:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-12-24 14:14:17,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-24 14:14:17,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:17,593 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2018-12-24 14:14:17,593 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:17,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2018-12-24 14:14:17,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:17,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:17,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:17,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:17,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-24 14:14:18,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:18,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:18,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:18,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:18,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:18,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:18,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:18,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:18,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:18,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:18,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-24 14:14:18,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-24 14:14:19,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:19,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-24 14:14:19,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:19,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-24 14:14:19,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-24 14:14:19,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-24 14:14:19,958 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2018-12-24 14:14:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:20,152 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-12-24 14:14:20,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-24 14:14:20,153 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-12-24 14:14:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:20,154 INFO L225 Difference]: With dead ends: 109 [2018-12-24 14:14:20,154 INFO L226 Difference]: Without dead ends: 73 [2018-12-24 14:14:20,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-24 14:14:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-24 14:14:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-24 14:14:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-24 14:14:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-24 14:14:20,157 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2018-12-24 14:14:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:20,157 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-24 14:14:20,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-24 14:14:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-24 14:14:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-24 14:14:20,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:20,159 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2018-12-24 14:14:20,159 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:20,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:20,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2018-12-24 14:14:20,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:20,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:20,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-24 14:14:20,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:20,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:20,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:20,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:20,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:20,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:20,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:20,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:21,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-24 14:14:21,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-24 14:14:22,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:22,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-24 14:14:22,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:22,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-24 14:14:22,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-24 14:14:22,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-24 14:14:22,350 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2018-12-24 14:14:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:22,539 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-12-24 14:14:22,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-24 14:14:22,540 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-12-24 14:14:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:22,540 INFO L225 Difference]: With dead ends: 112 [2018-12-24 14:14:22,541 INFO L226 Difference]: Without dead ends: 75 [2018-12-24 14:14:22,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-24 14:14:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-24 14:14:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-24 14:14:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-24 14:14:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-24 14:14:22,546 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-24 14:14:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:22,546 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-24 14:14:22,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-24 14:14:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-24 14:14:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-24 14:14:22,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:22,547 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2018-12-24 14:14:22,547 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:22,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:22,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2018-12-24 14:14:22,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:22,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:22,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:22,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:22,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-24 14:14:23,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:23,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:23,603 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:23,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:23,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:23,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:23,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:23,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:24,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-24 14:14:24,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:24,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-24 14:14:24,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-24 14:14:25,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:25,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-24 14:14:25,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:25,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-24 14:14:25,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-24 14:14:25,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 14:14:25,485 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2018-12-24 14:14:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:25,622 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2018-12-24 14:14:25,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-24 14:14:25,622 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-12-24 14:14:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:25,623 INFO L225 Difference]: With dead ends: 115 [2018-12-24 14:14:25,623 INFO L226 Difference]: Without dead ends: 77 [2018-12-24 14:14:25,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 14:14:25,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-24 14:14:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-24 14:14:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-24 14:14:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-24 14:14:25,625 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-12-24 14:14:25,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:25,626 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-24 14:14:25,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-24 14:14:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-24 14:14:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-24 14:14:25,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:25,626 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2018-12-24 14:14:25,627 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:25,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:25,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2018-12-24 14:14:25,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:25,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:25,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:25,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:25,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-24 14:14:26,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:26,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:26,452 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:26,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:26,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:26,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:26,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:26,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:26,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:26,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:26,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-24 14:14:26,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-24 14:14:28,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:28,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-24 14:14:28,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:28,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-24 14:14:28,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-24 14:14:28,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-24 14:14:28,393 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2018-12-24 14:14:28,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:28,548 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2018-12-24 14:14:28,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-24 14:14:28,549 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-12-24 14:14:28,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:28,550 INFO L225 Difference]: With dead ends: 118 [2018-12-24 14:14:28,550 INFO L226 Difference]: Without dead ends: 79 [2018-12-24 14:14:28,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-24 14:14:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-24 14:14:28,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-24 14:14:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-24 14:14:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-24 14:14:28,554 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-12-24 14:14:28,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:28,554 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-24 14:14:28,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-24 14:14:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-24 14:14:28,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-24 14:14:28,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:28,555 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2018-12-24 14:14:28,555 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:28,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:28,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2018-12-24 14:14:28,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:28,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:28,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:28,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:28,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-24 14:14:29,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:29,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:29,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:29,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:29,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:29,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:29,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:29,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:29,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-24 14:14:29,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-24 14:14:30,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:30,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-24 14:14:30,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:30,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-24 14:14:30,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-24 14:14:30,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-24 14:14:30,869 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2018-12-24 14:14:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:31,018 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2018-12-24 14:14:31,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-24 14:14:31,018 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-12-24 14:14:31,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:31,019 INFO L225 Difference]: With dead ends: 121 [2018-12-24 14:14:31,019 INFO L226 Difference]: Without dead ends: 81 [2018-12-24 14:14:31,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-24 14:14:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-24 14:14:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-24 14:14:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-24 14:14:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-24 14:14:31,022 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-12-24 14:14:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:31,022 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-24 14:14:31,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-24 14:14:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-24 14:14:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-24 14:14:31,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:31,023 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2018-12-24 14:14:31,023 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:31,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:31,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2018-12-24 14:14:31,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:31,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:31,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:31,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:31,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-24 14:14:31,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:31,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:31,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:31,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:31,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:31,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:31,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:31,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:32,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-24 14:14:32,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:32,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-24 14:14:32,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-24 14:14:34,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:34,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-24 14:14:34,172 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:34,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-24 14:14:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-24 14:14:34,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 14:14:34,174 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2018-12-24 14:14:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:34,326 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2018-12-24 14:14:34,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-24 14:14:34,326 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-12-24 14:14:34,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:34,327 INFO L225 Difference]: With dead ends: 124 [2018-12-24 14:14:34,327 INFO L226 Difference]: Without dead ends: 83 [2018-12-24 14:14:34,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 14:14:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-24 14:14:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-24 14:14:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-24 14:14:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-12-24 14:14:34,330 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-12-24 14:14:34,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:34,330 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-12-24 14:14:34,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-24 14:14:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-12-24 14:14:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-24 14:14:34,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:34,331 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2018-12-24 14:14:34,331 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:34,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:34,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2018-12-24 14:14:34,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:34,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:34,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:34,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:34,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-24 14:14:35,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:35,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:35,264 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:35,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:35,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:35,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:35,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:35,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:35,334 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:35,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:35,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-24 14:14:35,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-24 14:14:37,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:37,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-24 14:14:37,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:37,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-24 14:14:37,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-24 14:14:37,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-24 14:14:37,097 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2018-12-24 14:14:37,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:37,255 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2018-12-24 14:14:37,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-24 14:14:37,256 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-12-24 14:14:37,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:37,257 INFO L225 Difference]: With dead ends: 127 [2018-12-24 14:14:37,257 INFO L226 Difference]: Without dead ends: 85 [2018-12-24 14:14:37,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-24 14:14:37,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-24 14:14:37,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-24 14:14:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-24 14:14:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-24 14:14:37,262 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-12-24 14:14:37,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:37,262 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-24 14:14:37,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-24 14:14:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-24 14:14:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-24 14:14:37,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:37,263 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2018-12-24 14:14:37,263 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:37,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:37,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2018-12-24 14:14:37,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:37,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:37,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:37,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:37,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-24 14:14:38,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:38,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:38,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:38,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:38,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:38,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:38,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:38,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:38,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:38,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-24 14:14:38,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-24 14:14:40,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:40,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-24 14:14:40,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:40,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-24 14:14:40,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-24 14:14:40,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-24 14:14:40,414 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2018-12-24 14:14:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:40,589 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-12-24 14:14:40,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-24 14:14:40,589 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-12-24 14:14:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:40,590 INFO L225 Difference]: With dead ends: 130 [2018-12-24 14:14:40,590 INFO L226 Difference]: Without dead ends: 87 [2018-12-24 14:14:40,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-24 14:14:40,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-24 14:14:40,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-24 14:14:40,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-24 14:14:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-24 14:14:40,595 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-24 14:14:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:40,595 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-24 14:14:40,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-24 14:14:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-24 14:14:40,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-24 14:14:40,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:40,596 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2018-12-24 14:14:40,596 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:40,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:40,596 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2018-12-24 14:14:40,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:40,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:40,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:40,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:40,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-24 14:14:41,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:41,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:41,703 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:41,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:41,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:41,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:41,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:41,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:42,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-24 14:14:42,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:42,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-24 14:14:42,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:44,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-24 14:14:44,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:44,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-24 14:14:44,268 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:44,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-24 14:14:44,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-24 14:14:44,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 14:14:44,269 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2018-12-24 14:14:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:44,445 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2018-12-24 14:14:44,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-24 14:14:44,446 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-12-24 14:14:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:44,447 INFO L225 Difference]: With dead ends: 133 [2018-12-24 14:14:44,447 INFO L226 Difference]: Without dead ends: 89 [2018-12-24 14:14:44,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 14:14:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-24 14:14:44,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-24 14:14:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-24 14:14:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-24 14:14:44,451 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2018-12-24 14:14:44,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:44,451 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-24 14:14:44,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-24 14:14:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-24 14:14:44,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-24 14:14:44,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:44,452 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2018-12-24 14:14:44,452 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:44,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:44,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2018-12-24 14:14:44,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:44,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:44,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:44,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:44,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-24 14:14:45,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:45,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:45,384 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:45,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:45,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:45,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:45,393 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:45,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:45,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:45,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:45,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-24 14:14:45,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-24 14:14:47,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:47,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-24 14:14:47,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:47,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-24 14:14:47,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-24 14:14:47,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-24 14:14:47,784 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2018-12-24 14:14:47,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:47,969 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-12-24 14:14:47,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-24 14:14:47,970 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-12-24 14:14:47,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:47,971 INFO L225 Difference]: With dead ends: 136 [2018-12-24 14:14:47,971 INFO L226 Difference]: Without dead ends: 91 [2018-12-24 14:14:47,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-24 14:14:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-24 14:14:47,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-24 14:14:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-24 14:14:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-24 14:14:47,974 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-12-24 14:14:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:47,975 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-24 14:14:47,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-24 14:14:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-24 14:14:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-24 14:14:47,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:47,975 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2018-12-24 14:14:47,976 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:47,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:47,976 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2018-12-24 14:14:47,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:47,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:47,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:47,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:47,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-24 14:14:49,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:49,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:49,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:49,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:49,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:49,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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:49,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:49,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:14:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:49,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-24 14:14:49,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-24 14:14:51,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:51,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-24 14:14:51,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:51,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-24 14:14:51,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-24 14:14:51,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-24 14:14:51,727 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2018-12-24 14:14:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:52,008 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2018-12-24 14:14:52,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-24 14:14:52,008 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-12-24 14:14:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:52,009 INFO L225 Difference]: With dead ends: 139 [2018-12-24 14:14:52,009 INFO L226 Difference]: Without dead ends: 93 [2018-12-24 14:14:52,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-24 14:14:52,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-24 14:14:52,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-24 14:14:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-24 14:14:52,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-24 14:14:52,012 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-12-24 14:14:52,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:52,012 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-24 14:14:52,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-24 14:14:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-24 14:14:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-24 14:14:52,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:52,013 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2018-12-24 14:14:52,013 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:52,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:52,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2018-12-24 14:14:52,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:52,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:52,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:14:52,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:52,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-24 14:14:52,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:52,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:52,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:52,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:52,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:52,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:52,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:14:52,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:14:53,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-24 14:14:53,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:53,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-24 14:14:53,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:14:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-24 14:14:55,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:14:55,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-24 14:14:55,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:14:55,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-24 14:14:55,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-24 14:14:55,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 14:14:55,791 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2018-12-24 14:14:57,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:14:57,777 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2018-12-24 14:14:57,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-24 14:14:57,778 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-12-24 14:14:57,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:14:57,779 INFO L225 Difference]: With dead ends: 142 [2018-12-24 14:14:57,779 INFO L226 Difference]: Without dead ends: 95 [2018-12-24 14:14:57,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 14:14:57,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-24 14:14:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-24 14:14:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-24 14:14:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-12-24 14:14:57,784 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-12-24 14:14:57,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:14:57,784 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-12-24 14:14:57,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-24 14:14:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-12-24 14:14:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-24 14:14:57,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:14:57,785 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2018-12-24 14:14:57,785 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:14:57,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:14:57,786 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2018-12-24 14:14:57,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:14:57,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:57,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:14:57,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:14:57,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:14:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:14:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-24 14:14:59,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:59,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:14:59,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:14:59,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:14:59,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:14:59,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:14:59,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:14:59,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:14:59,135 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:14:59,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:14:59,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:14:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-24 14:14:59,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-24 14:15:02,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:02,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-24 14:15:02,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:02,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-24 14:15:02,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-24 14:15:02,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-24 14:15:02,672 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2018-12-24 14:15:02,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:02,911 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2018-12-24 14:15:02,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-24 14:15:02,913 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-12-24 14:15:02,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:02,913 INFO L225 Difference]: With dead ends: 145 [2018-12-24 14:15:02,913 INFO L226 Difference]: Without dead ends: 97 [2018-12-24 14:15:02,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-24 14:15:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-24 14:15:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-24 14:15:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-24 14:15:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-24 14:15:02,917 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-12-24 14:15:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:02,917 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-24 14:15:02,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-24 14:15:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-24 14:15:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-24 14:15:02,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:02,918 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2018-12-24 14:15:02,918 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:02,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:02,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2018-12-24 14:15:02,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:02,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:02,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:02,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:02,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-24 14:15:04,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:04,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:04,539 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:04,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:04,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:04,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:04,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:04,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:15:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:04,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-24 14:15:04,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-24 14:15:06,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:06,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-24 14:15:06,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:06,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-24 14:15:06,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-24 14:15:06,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-24 14:15:06,989 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2018-12-24 14:15:07,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:07,362 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2018-12-24 14:15:07,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-24 14:15:07,363 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-12-24 14:15:07,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:07,364 INFO L225 Difference]: With dead ends: 148 [2018-12-24 14:15:07,364 INFO L226 Difference]: Without dead ends: 99 [2018-12-24 14:15:07,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-24 14:15:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-24 14:15:07,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-24 14:15:07,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-24 14:15:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-24 14:15:07,369 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-24 14:15:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:07,369 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-24 14:15:07,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-24 14:15:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-24 14:15:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-24 14:15:07,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:07,370 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2018-12-24 14:15:07,370 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:07,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:07,371 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2018-12-24 14:15:07,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:07,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:07,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:07,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:07,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-24 14:15:08,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:08,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:08,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:08,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:08,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:08,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:08,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:15:08,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:15:08,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-24 14:15:08,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:15:08,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-24 14:15:08,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-24 14:15:11,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:11,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-24 14:15:11,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:11,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-24 14:15:11,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-24 14:15:11,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 14:15:11,920 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2018-12-24 14:15:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:12,112 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2018-12-24 14:15:12,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-24 14:15:12,112 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-12-24 14:15:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:12,113 INFO L225 Difference]: With dead ends: 151 [2018-12-24 14:15:12,113 INFO L226 Difference]: Without dead ends: 101 [2018-12-24 14:15:12,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 14:15:12,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-24 14:15:12,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-24 14:15:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-24 14:15:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-12-24 14:15:12,116 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-12-24 14:15:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:12,116 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-12-24 14:15:12,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-24 14:15:12,117 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-12-24 14:15:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-24 14:15:12,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:12,117 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2018-12-24 14:15:12,117 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:12,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:12,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2018-12-24 14:15:12,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:12,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:12,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:12,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:12,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-24 14:15:13,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:13,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:13,117 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:13,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:13,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:13,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:13,125 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:15:13,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:15:13,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:15:13,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:15:13,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-24 14:15:13,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-24 14:15:16,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:16,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-24 14:15:16,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:16,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-24 14:15:16,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-24 14:15:16,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-24 14:15:16,104 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2018-12-24 14:15:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:16,382 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2018-12-24 14:15:16,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-24 14:15:16,385 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-12-24 14:15:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:16,386 INFO L225 Difference]: With dead ends: 154 [2018-12-24 14:15:16,386 INFO L226 Difference]: Without dead ends: 103 [2018-12-24 14:15:16,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-24 14:15:16,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-24 14:15:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-24 14:15:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-24 14:15:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-24 14:15:16,394 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-12-24 14:15:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:16,395 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-24 14:15:16,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-24 14:15:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-24 14:15:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-24 14:15:16,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:16,395 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2018-12-24 14:15:16,396 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:16,396 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2018-12-24 14:15:16,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:16,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:16,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:16,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:16,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-24 14:15:17,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:17,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:17,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:17,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:17,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:17,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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:17,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:17,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:15:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:17,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-24 14:15:17,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-24 14:15:20,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:20,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-24 14:15:20,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:20,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-24 14:15:20,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-24 14:15:20,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-24 14:15:20,597 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2018-12-24 14:15:20,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:20,849 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2018-12-24 14:15:20,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-24 14:15:20,850 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-12-24 14:15:20,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:20,851 INFO L225 Difference]: With dead ends: 157 [2018-12-24 14:15:20,851 INFO L226 Difference]: Without dead ends: 105 [2018-12-24 14:15:20,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-24 14:15:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-24 14:15:20,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-24 14:15:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-24 14:15:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-24 14:15:20,855 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-12-24 14:15:20,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:20,855 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-24 14:15:20,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-24 14:15:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-24 14:15:20,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-24 14:15:20,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:20,856 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2018-12-24 14:15:20,857 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:20,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:20,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2018-12-24 14:15:20,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:20,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:20,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:20,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:20,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-24 14:15:21,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:21,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:21,871 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:21,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:21,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:21,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:21,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:15:21,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:15:23,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-24 14:15:23,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:15:23,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:23,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-24 14:15:23,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-24 14:15:26,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:26,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-24 14:15:26,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:26,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-24 14:15:26,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-24 14:15:26,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 14:15:26,337 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2018-12-24 14:15:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:27,308 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-12-24 14:15:27,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-24 14:15:27,308 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-12-24 14:15:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:27,309 INFO L225 Difference]: With dead ends: 160 [2018-12-24 14:15:27,309 INFO L226 Difference]: Without dead ends: 107 [2018-12-24 14:15:27,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 14:15:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-24 14:15:27,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-24 14:15:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-24 14:15:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-12-24 14:15:27,314 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-12-24 14:15:27,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:27,314 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-12-24 14:15:27,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-24 14:15:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-12-24 14:15:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-24 14:15:27,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:27,315 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2018-12-24 14:15:27,315 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:27,315 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2018-12-24 14:15:27,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:27,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:27,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:27,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:27,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-24 14:15:28,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:28,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:28,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:28,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:28,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:28,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:28,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:15:28,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:15:28,926 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:15:28,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:15:28,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-24 14:15:28,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-24 14:15:32,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:32,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-24 14:15:32,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:32,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-24 14:15:32,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-24 14:15:32,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-24 14:15:32,075 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2018-12-24 14:15:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:32,345 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2018-12-24 14:15:32,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-24 14:15:32,346 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-12-24 14:15:32,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:32,346 INFO L225 Difference]: With dead ends: 163 [2018-12-24 14:15:32,347 INFO L226 Difference]: Without dead ends: 109 [2018-12-24 14:15:32,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-24 14:15:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-24 14:15:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-24 14:15:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-24 14:15:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-24 14:15:32,351 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-12-24 14:15:32,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:32,351 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-24 14:15:32,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-24 14:15:32,351 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-24 14:15:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-24 14:15:32,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:32,352 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2018-12-24 14:15:32,352 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:32,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:32,352 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2018-12-24 14:15:32,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:32,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:32,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-24 14:15:33,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:33,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:33,518 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:33,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:33,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:33,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:33,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:33,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:15:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:33,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-24 14:15:33,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-24 14:15:36,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:36,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-24 14:15:36,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:36,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-24 14:15:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-24 14:15:36,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-24 14:15:36,870 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2018-12-24 14:15:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:37,118 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2018-12-24 14:15:37,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-24 14:15:37,119 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-12-24 14:15:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:37,119 INFO L225 Difference]: With dead ends: 166 [2018-12-24 14:15:37,119 INFO L226 Difference]: Without dead ends: 111 [2018-12-24 14:15:37,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-24 14:15:37,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-24 14:15:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-24 14:15:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-24 14:15:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-24 14:15:37,123 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-24 14:15:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:37,123 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-24 14:15:37,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-24 14:15:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-24 14:15:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-24 14:15:37,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:37,124 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2018-12-24 14:15:37,124 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:37,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:37,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2018-12-24 14:15:37,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:37,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:37,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:37,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:37,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-24 14:15:38,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:38,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:38,343 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:38,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:38,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:38,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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:38,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:15:38,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:15:39,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-24 14:15:39,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:15:39,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-24 14:15:39,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:42,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-24 14:15:42,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:42,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-24 14:15:42,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:42,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-24 14:15:42,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-24 14:15:42,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 14:15:42,861 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2018-12-24 14:15:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:43,144 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-12-24 14:15:43,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-24 14:15:43,145 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-12-24 14:15:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:43,145 INFO L225 Difference]: With dead ends: 169 [2018-12-24 14:15:43,145 INFO L226 Difference]: Without dead ends: 113 [2018-12-24 14:15:43,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 14:15:43,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-24 14:15:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-24 14:15:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-24 14:15:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-12-24 14:15:43,148 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-12-24 14:15:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:43,149 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-12-24 14:15:43,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-24 14:15:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-12-24 14:15:43,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-24 14:15:43,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:43,150 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2018-12-24 14:15:43,150 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:43,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:43,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2018-12-24 14:15:43,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:43,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:43,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:43,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:43,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-24 14:15:45,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:45,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:45,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:45,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:45,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:45,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:45,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:15:45,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:15:45,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:15:45,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:15:45,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-24 14:15:45,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-24 14:15:48,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:48,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-24 14:15:48,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:48,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-24 14:15:48,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-24 14:15:48,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-24 14:15:48,408 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2018-12-24 14:15:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:48,652 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2018-12-24 14:15:48,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-24 14:15:48,653 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-12-24 14:15:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:48,654 INFO L225 Difference]: With dead ends: 172 [2018-12-24 14:15:48,654 INFO L226 Difference]: Without dead ends: 115 [2018-12-24 14:15:48,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-24 14:15:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-24 14:15:48,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-24 14:15:48,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-24 14:15:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-12-24 14:15:48,659 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-12-24 14:15:48,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:48,659 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-12-24 14:15:48,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-24 14:15:48,659 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-12-24 14:15:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-24 14:15:48,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:48,660 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2018-12-24 14:15:48,660 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:48,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:48,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2018-12-24 14:15:48,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:48,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:48,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:15:48,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:48,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-24 14:15:50,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:50,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:50,421 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:50,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:50,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:50,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:50,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:50,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:15:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:50,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-24 14:15:50,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:15:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-24 14:15:54,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:15:54,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-24 14:15:54,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:15:54,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-24 14:15:54,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-24 14:15:54,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-24 14:15:54,345 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2018-12-24 14:15:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:15:54,860 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2018-12-24 14:15:54,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-24 14:15:54,860 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-12-24 14:15:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:15:54,861 INFO L225 Difference]: With dead ends: 175 [2018-12-24 14:15:54,861 INFO L226 Difference]: Without dead ends: 117 [2018-12-24 14:15:54,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-24 14:15:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-24 14:15:54,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-24 14:15:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-24 14:15:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-12-24 14:15:54,866 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-12-24 14:15:54,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:15:54,866 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-12-24 14:15:54,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-24 14:15:54,867 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-12-24 14:15:54,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-24 14:15:54,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:15:54,867 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2018-12-24 14:15:54,868 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:15:54,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:15:54,868 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2018-12-24 14:15:54,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:15:54,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:54,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:15:54,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:15:54,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:15:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:15:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-24 14:15:56,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:56,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:15:56,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:15:56,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:15:56,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:15:56,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:15:56,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:15:56,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:15:57,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-24 14:15:57,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:15:57,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:15:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-24 14:15:57,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-24 14:16:01,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:01,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-24 14:16:01,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:01,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-24 14:16:01,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-24 14:16:01,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 14:16:01,002 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2018-12-24 14:16:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:01,347 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2018-12-24 14:16:01,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-24 14:16:01,347 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-12-24 14:16:01,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:01,348 INFO L225 Difference]: With dead ends: 178 [2018-12-24 14:16:01,348 INFO L226 Difference]: Without dead ends: 119 [2018-12-24 14:16:01,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 14:16:01,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-24 14:16:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-24 14:16:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-24 14:16:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-12-24 14:16:01,352 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2018-12-24 14:16:01,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:01,352 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-12-24 14:16:01,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-24 14:16:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-12-24 14:16:01,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-24 14:16:01,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:01,353 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2018-12-24 14:16:01,353 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:01,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:01,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2018-12-24 14:16:01,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:01,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:01,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:16:01,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:01,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-24 14:16:02,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:02,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:02,666 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:02,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:02,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:02,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:02,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:16:02,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:16:02,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:16:02,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:16:02,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-24 14:16:02,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-24 14:16:06,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:06,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-24 14:16:06,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:06,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-24 14:16:06,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-24 14:16:06,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-24 14:16:06,897 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2018-12-24 14:16:07,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:07,202 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2018-12-24 14:16:07,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-24 14:16:07,202 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-12-24 14:16:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:07,203 INFO L225 Difference]: With dead ends: 181 [2018-12-24 14:16:07,203 INFO L226 Difference]: Without dead ends: 121 [2018-12-24 14:16:07,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-24 14:16:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-24 14:16:07,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-24 14:16:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-24 14:16:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-12-24 14:16:07,207 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2018-12-24 14:16:07,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:07,207 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-12-24 14:16:07,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-24 14:16:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-12-24 14:16:07,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-24 14:16:07,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:07,208 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2018-12-24 14:16:07,208 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:07,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:07,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2018-12-24 14:16:07,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:07,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:07,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:16:07,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:07,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-24 14:16:08,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:08,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:08,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:08,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:08,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:08,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:08,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:08,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:16:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:08,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-24 14:16:08,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-24 14:16:12,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:12,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-24 14:16:12,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:12,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-24 14:16:12,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-24 14:16:12,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-24 14:16:12,707 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2018-12-24 14:16:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:13,091 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2018-12-24 14:16:13,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-24 14:16:13,091 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-12-24 14:16:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:13,092 INFO L225 Difference]: With dead ends: 184 [2018-12-24 14:16:13,092 INFO L226 Difference]: Without dead ends: 123 [2018-12-24 14:16:13,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-24 14:16:13,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-24 14:16:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-24 14:16:13,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-24 14:16:13,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-12-24 14:16:13,096 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-12-24 14:16:13,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:13,096 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-12-24 14:16:13,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-24 14:16:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-12-24 14:16:13,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-24 14:16:13,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:13,098 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2018-12-24 14:16:13,098 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:13,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:13,098 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2018-12-24 14:16:13,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:13,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:13,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:13,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:13,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-24 14:16:14,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:14,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:14,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:14,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:14,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:14,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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:14,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:16:14,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:16:15,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-24 14:16:15,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:16:15,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-24 14:16:15,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:19,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-24 14:16:19,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:19,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-24 14:16:19,572 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:19,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-24 14:16:19,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-24 14:16:19,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 14:16:19,574 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2018-12-24 14:16:19,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:19,928 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2018-12-24 14:16:19,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-24 14:16:19,929 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-12-24 14:16:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:19,929 INFO L225 Difference]: With dead ends: 187 [2018-12-24 14:16:19,930 INFO L226 Difference]: Without dead ends: 125 [2018-12-24 14:16:19,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 14:16:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-24 14:16:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-24 14:16:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-24 14:16:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-12-24 14:16:19,935 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2018-12-24 14:16:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:19,935 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-12-24 14:16:19,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-24 14:16:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-12-24 14:16:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-24 14:16:19,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:19,936 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2018-12-24 14:16:19,937 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:19,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:19,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2018-12-24 14:16:19,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:19,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:19,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:16:19,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:19,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-24 14:16:21,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:21,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:21,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:21,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:21,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:21,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:21,716 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:16:21,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:16:21,800 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:16:21,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:16:21,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-24 14:16:21,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-24 14:16:25,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:25,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-24 14:16:25,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:25,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-24 14:16:25,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-24 14:16:25,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-24 14:16:25,973 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2018-12-24 14:16:26,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:26,263 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2018-12-24 14:16:26,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-24 14:16:26,264 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-12-24 14:16:26,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:26,265 INFO L225 Difference]: With dead ends: 190 [2018-12-24 14:16:26,265 INFO L226 Difference]: Without dead ends: 127 [2018-12-24 14:16:26,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-24 14:16:26,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-24 14:16:26,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-24 14:16:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-24 14:16:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-12-24 14:16:26,270 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2018-12-24 14:16:26,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:26,270 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-12-24 14:16:26,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-24 14:16:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-12-24 14:16:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-24 14:16:26,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:26,271 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2018-12-24 14:16:26,271 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:26,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:26,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2018-12-24 14:16:26,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:26,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:26,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:16:26,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:26,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-24 14:16:27,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:27,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:27,695 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:27,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:27,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:27,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:27,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:27,704 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:16:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:27,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-24 14:16:27,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-24 14:16:32,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:32,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-24 14:16:32,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:32,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-24 14:16:32,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-24 14:16:32,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-24 14:16:32,101 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2018-12-24 14:16:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:32,496 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2018-12-24 14:16:32,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-24 14:16:32,496 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-12-24 14:16:32,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:32,497 INFO L225 Difference]: With dead ends: 193 [2018-12-24 14:16:32,497 INFO L226 Difference]: Without dead ends: 129 [2018-12-24 14:16:32,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-24 14:16:32,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-24 14:16:32,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-24 14:16:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-24 14:16:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-12-24 14:16:32,501 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-12-24 14:16:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:32,501 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-12-24 14:16:32,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-24 14:16:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-12-24 14:16:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-24 14:16:32,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:32,502 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2018-12-24 14:16:32,502 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:32,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:32,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2018-12-24 14:16:32,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:32,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:32,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:32,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:32,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-24 14:16:33,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:33,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:33,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:33,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:33,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:33,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:33,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:16:33,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:16:35,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-24 14:16:35,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:16:35,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-24 14:16:35,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-24 14:16:39,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:39,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-24 14:16:39,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:39,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-24 14:16:39,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-24 14:16:39,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 14:16:39,698 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2018-12-24 14:16:40,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:40,104 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2018-12-24 14:16:40,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-24 14:16:40,104 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-12-24 14:16:40,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:40,105 INFO L225 Difference]: With dead ends: 196 [2018-12-24 14:16:40,105 INFO L226 Difference]: Without dead ends: 131 [2018-12-24 14:16:40,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 14:16:40,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-24 14:16:40,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-24 14:16:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-24 14:16:40,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-12-24 14:16:40,109 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-12-24 14:16:40,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:40,109 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-12-24 14:16:40,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-24 14:16:40,109 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-12-24 14:16:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-24 14:16:40,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:40,109 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2018-12-24 14:16:40,110 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:40,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:40,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2018-12-24 14:16:40,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:40,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:40,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:16:40,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:40,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-24 14:16:42,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:42,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:42,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:42,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:42,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:42,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:42,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:16:42,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:16:42,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:16:42,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:16:42,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-24 14:16:42,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-24 14:16:46,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:46,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-24 14:16:46,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:46,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-24 14:16:46,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-24 14:16:46,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-24 14:16:46,671 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2018-12-24 14:16:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:47,104 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2018-12-24 14:16:47,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-24 14:16:47,105 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-12-24 14:16:47,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:47,105 INFO L225 Difference]: With dead ends: 199 [2018-12-24 14:16:47,106 INFO L226 Difference]: Without dead ends: 133 [2018-12-24 14:16:47,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-24 14:16:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-24 14:16:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-24 14:16:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-24 14:16:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-12-24 14:16:47,109 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-12-24 14:16:47,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:47,109 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-12-24 14:16:47,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-24 14:16:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-12-24 14:16:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-24 14:16:47,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:47,111 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2018-12-24 14:16:47,111 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:47,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:47,111 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2018-12-24 14:16:47,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:47,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:47,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:16:47,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:47,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-24 14:16:48,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:48,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:48,708 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:48,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:48,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:48,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:48,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:48,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:16:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:48,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:16:48,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-24 14:16:48,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:16:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-24 14:16:54,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:16:54,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-24 14:16:54,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:16:54,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-24 14:16:54,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-24 14:16:54,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-24 14:16:54,403 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2018-12-24 14:16:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:16:54,879 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2018-12-24 14:16:54,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-24 14:16:54,879 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-12-24 14:16:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:16:54,880 INFO L225 Difference]: With dead ends: 202 [2018-12-24 14:16:54,880 INFO L226 Difference]: Without dead ends: 135 [2018-12-24 14:16:54,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-24 14:16:54,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-24 14:16:54,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-24 14:16:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-24 14:16:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-12-24 14:16:54,886 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-12-24 14:16:54,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:16:54,886 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-12-24 14:16:54,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-24 14:16:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-12-24 14:16:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-24 14:16:54,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:16:54,887 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2018-12-24 14:16:54,887 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:16:54,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:16:54,888 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2018-12-24 14:16:54,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:16:54,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:54,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:16:54,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:16:54,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:16:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:16:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-24 14:16:56,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:56,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:16:56,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:16:56,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:16:56,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:16:56,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:16:56,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:16:56,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:17:00,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-24 14:17:00,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:00,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-24 14:17:00,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-24 14:17:05,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:05,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-24 14:17:05,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:05,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-24 14:17:05,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-24 14:17:05,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 14:17:05,548 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2018-12-24 14:17:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:05,962 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2018-12-24 14:17:05,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-24 14:17:05,962 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-12-24 14:17:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:05,963 INFO L225 Difference]: With dead ends: 205 [2018-12-24 14:17:05,963 INFO L226 Difference]: Without dead ends: 137 [2018-12-24 14:17:05,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 14:17:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-24 14:17:05,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-24 14:17:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-24 14:17:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-12-24 14:17:05,967 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2018-12-24 14:17:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:05,967 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-12-24 14:17:05,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-24 14:17:05,967 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-12-24 14:17:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-24 14:17:05,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:05,968 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2018-12-24 14:17:05,968 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:05,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:05,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2018-12-24 14:17:05,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:05,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:05,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:05,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:05,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-24 14:17:07,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:07,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:07,932 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:07,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:07,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:07,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:07,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:17:07,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:17:08,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:17:08,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:08,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-24 14:17:08,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-24 14:17:13,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:13,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-24 14:17:13,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:13,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-24 14:17:13,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-24 14:17:13,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-24 14:17:13,175 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2018-12-24 14:17:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:13,688 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2018-12-24 14:17:13,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-24 14:17:13,688 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-12-24 14:17:13,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:13,689 INFO L225 Difference]: With dead ends: 208 [2018-12-24 14:17:13,689 INFO L226 Difference]: Without dead ends: 139 [2018-12-24 14:17:13,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-24 14:17:13,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-24 14:17:13,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-24 14:17:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-24 14:17:13,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-12-24 14:17:13,693 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2018-12-24 14:17:13,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:13,694 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-12-24 14:17:13,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-24 14:17:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-12-24 14:17:13,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-24 14:17:13,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:13,695 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2018-12-24 14:17:13,695 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:13,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:13,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2018-12-24 14:17:13,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:13,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:13,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:13,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:13,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-24 14:17:15,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:15,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:15,382 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:15,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:15,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:15,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:15,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:15,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:17:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:15,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-24 14:17:15,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-24 14:17:20,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:20,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-24 14:17:20,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:20,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-24 14:17:20,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-24 14:17:20,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-24 14:17:20,707 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2018-12-24 14:17:21,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:21,197 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2018-12-24 14:17:21,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-24 14:17:21,197 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-12-24 14:17:21,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:21,198 INFO L225 Difference]: With dead ends: 211 [2018-12-24 14:17:21,198 INFO L226 Difference]: Without dead ends: 141 [2018-12-24 14:17:21,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-24 14:17:21,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-24 14:17:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-24 14:17:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-24 14:17:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-12-24 14:17:21,202 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-12-24 14:17:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:21,202 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-12-24 14:17:21,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-24 14:17:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-12-24 14:17:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-24 14:17:21,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:21,203 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2018-12-24 14:17:21,203 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:21,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:21,203 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2018-12-24 14:17:21,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:21,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:21,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:21,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:21,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-24 14:17:23,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:23,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:23,239 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:23,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:23,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:23,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:23,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:17:23,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:17:27,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-24 14:17:27,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:27,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-24 14:17:27,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-24 14:17:32,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:32,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-24 14:17:32,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:32,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-24 14:17:32,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-24 14:17:32,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 14:17:32,488 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2018-12-24 14:17:33,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:33,037 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2018-12-24 14:17:33,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-24 14:17:33,038 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-12-24 14:17:33,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:33,038 INFO L225 Difference]: With dead ends: 214 [2018-12-24 14:17:33,038 INFO L226 Difference]: Without dead ends: 143 [2018-12-24 14:17:33,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 14:17:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-24 14:17:33,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-12-24 14:17:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-24 14:17:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-12-24 14:17:33,042 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-12-24 14:17:33,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:33,042 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-12-24 14:17:33,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-24 14:17:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-12-24 14:17:33,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-24 14:17:33,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:33,043 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2018-12-24 14:17:33,043 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:33,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:33,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2018-12-24 14:17:33,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:33,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:33,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:33,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:33,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-24 14:17:34,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:34,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:34,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:34,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:34,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:34,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:34,844 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:17:34,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:17:34,942 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:17:34,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:34,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-24 14:17:34,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-24 14:17:40,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:40,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-24 14:17:40,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:40,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-24 14:17:40,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-24 14:17:40,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-24 14:17:40,303 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2018-12-24 14:17:40,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:40,840 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2018-12-24 14:17:40,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-24 14:17:40,840 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-12-24 14:17:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:40,841 INFO L225 Difference]: With dead ends: 217 [2018-12-24 14:17:40,841 INFO L226 Difference]: Without dead ends: 145 [2018-12-24 14:17:40,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-24 14:17:40,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-24 14:17:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-24 14:17:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-24 14:17:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-12-24 14:17:40,846 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2018-12-24 14:17:40,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:40,846 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-12-24 14:17:40,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-24 14:17:40,846 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-12-24 14:17:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-24 14:17:40,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:40,847 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2018-12-24 14:17:40,847 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:40,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:40,848 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2018-12-24 14:17:40,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:40,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:40,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:17:40,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:40,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-24 14:17:43,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:43,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:43,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:43,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:43,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:43,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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:43,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:43,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:17:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:43,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:43,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-24 14:17:43,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-24 14:17:48,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:48,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-24 14:17:48,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:48,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-24 14:17:48,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-24 14:17:48,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-24 14:17:48,578 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2018-12-24 14:17:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:17:49,010 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2018-12-24 14:17:49,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-24 14:17:49,011 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-12-24 14:17:49,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:17:49,011 INFO L225 Difference]: With dead ends: 220 [2018-12-24 14:17:49,012 INFO L226 Difference]: Without dead ends: 147 [2018-12-24 14:17:49,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-24 14:17:49,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-24 14:17:49,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-24 14:17:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-24 14:17:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-12-24 14:17:49,016 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-12-24 14:17:49,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:17:49,017 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-12-24 14:17:49,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-24 14:17:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-12-24 14:17:49,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-24 14:17:49,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:17:49,018 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2018-12-24 14:17:49,018 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:17:49,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:17:49,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2018-12-24 14:17:49,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:17:49,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:49,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:17:49,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:17:49,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:17:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:17:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-24 14:17:50,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:50,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:17:50,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:17:50,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:17:50,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:17:50,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:17:50,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:17:50,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:17:53,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-24 14:17:53,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:17:53,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:17:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-24 14:17:54,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:17:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-24 14:17:59,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:17:59,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-24 14:17:59,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:17:59,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-24 14:17:59,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-24 14:17:59,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 14:17:59,708 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2018-12-24 14:18:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:00,313 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2018-12-24 14:18:00,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-24 14:18:00,313 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-12-24 14:18:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:00,314 INFO L225 Difference]: With dead ends: 223 [2018-12-24 14:18:00,314 INFO L226 Difference]: Without dead ends: 149 [2018-12-24 14:18:00,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 14:18:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-24 14:18:00,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-12-24 14:18:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-24 14:18:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-12-24 14:18:00,319 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2018-12-24 14:18:00,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:00,319 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-12-24 14:18:00,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-24 14:18:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-12-24 14:18:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-24 14:18:00,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:00,320 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2018-12-24 14:18:00,320 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:00,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:00,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2018-12-24 14:18:00,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:00,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:00,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:00,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:00,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-24 14:18:02,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:02,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:02,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:02,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:02,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:02,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:02,512 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:02,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:02,619 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:02,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:02,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-24 14:18:02,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-24 14:18:08,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:08,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-24 14:18:08,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:08,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-24 14:18:08,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-24 14:18:08,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-24 14:18:08,964 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2018-12-24 14:18:09,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:09,531 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2018-12-24 14:18:09,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-24 14:18:09,532 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-12-24 14:18:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:09,532 INFO L225 Difference]: With dead ends: 226 [2018-12-24 14:18:09,532 INFO L226 Difference]: Without dead ends: 151 [2018-12-24 14:18:09,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-24 14:18:09,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-24 14:18:09,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-24 14:18:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-24 14:18:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-12-24 14:18:09,537 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2018-12-24 14:18:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:09,537 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-12-24 14:18:09,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-24 14:18:09,537 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-12-24 14:18:09,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-24 14:18:09,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:09,538 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2018-12-24 14:18:09,538 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:09,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:09,539 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2018-12-24 14:18:09,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:09,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:09,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:09,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:09,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-24 14:18:11,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:11,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:11,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:11,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:11,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:11,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:11,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:11,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:11,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-24 14:18:11,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-24 14:18:17,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:17,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-24 14:18:17,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:17,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-24 14:18:17,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-24 14:18:17,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-24 14:18:17,983 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2018-12-24 14:18:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:18,608 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2018-12-24 14:18:18,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-24 14:18:18,608 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-12-24 14:18:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:18,609 INFO L225 Difference]: With dead ends: 229 [2018-12-24 14:18:18,609 INFO L226 Difference]: Without dead ends: 153 [2018-12-24 14:18:18,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-24 14:18:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-24 14:18:18,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-24 14:18:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-24 14:18:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-12-24 14:18:18,614 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-12-24 14:18:18,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:18,614 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-12-24 14:18:18,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-24 14:18:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-12-24 14:18:18,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-24 14:18:18,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:18,615 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2018-12-24 14:18:18,615 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:18,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2018-12-24 14:18:18,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:18,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:18,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:18,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:18,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-24 14:18:20,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:20,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:20,761 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:20,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:20,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:20,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:20,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:20,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:23,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-24 14:18:23,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:23,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-24 14:18:23,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-24 14:18:29,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:29,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-24 14:18:29,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:29,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-24 14:18:29,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-24 14:18:29,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 14:18:29,742 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2018-12-24 14:18:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:30,373 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2018-12-24 14:18:30,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-24 14:18:30,374 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-12-24 14:18:30,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:30,374 INFO L225 Difference]: With dead ends: 232 [2018-12-24 14:18:30,375 INFO L226 Difference]: Without dead ends: 155 [2018-12-24 14:18:30,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 14:18:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-24 14:18:30,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-24 14:18:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-24 14:18:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-12-24 14:18:30,378 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2018-12-24 14:18:30,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:30,378 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-12-24 14:18:30,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-24 14:18:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-12-24 14:18:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-24 14:18:30,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:30,379 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2018-12-24 14:18:30,379 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:30,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:30,380 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2018-12-24 14:18:30,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:30,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:30,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:30,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:30,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-24 14:18:32,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:32,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:32,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:32,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:32,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:32,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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:32,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:18:32,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:18:32,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:18:32,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:32,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-24 14:18:32,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-24 14:18:39,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:39,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-24 14:18:39,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:39,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-24 14:18:39,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-24 14:18:39,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 14:18:39,254 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2018-12-24 14:18:39,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:39,978 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2018-12-24 14:18:39,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-24 14:18:39,979 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-12-24 14:18:39,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:39,979 INFO L225 Difference]: With dead ends: 235 [2018-12-24 14:18:39,979 INFO L226 Difference]: Without dead ends: 157 [2018-12-24 14:18:39,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 14:18:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-24 14:18:39,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-24 14:18:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-24 14:18:39,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-12-24 14:18:39,983 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2018-12-24 14:18:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:39,983 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-12-24 14:18:39,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-24 14:18:39,983 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-12-24 14:18:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-24 14:18:39,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:39,984 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2018-12-24 14:18:39,984 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:39,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:39,984 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2018-12-24 14:18:39,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:39,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:39,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:18:39,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:39,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-24 14:18:42,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:42,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:42,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:42,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:42,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:42,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:42,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:42,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:18:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:42,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-24 14:18:42,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:18:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-24 14:18:48,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:18:48,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-24 14:18:48,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:18:48,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-24 14:18:48,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-24 14:18:48,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 14:18:48,823 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2018-12-24 14:18:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:18:49,544 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2018-12-24 14:18:49,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-24 14:18:49,545 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-12-24 14:18:49,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:18:49,546 INFO L225 Difference]: With dead ends: 238 [2018-12-24 14:18:49,546 INFO L226 Difference]: Without dead ends: 159 [2018-12-24 14:18:49,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 14:18:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-24 14:18:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-24 14:18:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-24 14:18:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-12-24 14:18:49,551 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-12-24 14:18:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:18:49,551 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-12-24 14:18:49,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-24 14:18:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-12-24 14:18:49,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-24 14:18:49,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:18:49,552 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2018-12-24 14:18:49,553 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:18:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:18:49,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2018-12-24 14:18:49,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:18:49,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:49,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:18:49,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:18:49,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:18:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:18:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-24 14:18:51,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:51,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:18:51,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:18:51,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:18:51,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:18:51,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:18:51,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:18:51,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:18:56,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-24 14:18:56,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:18:56,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:18:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-24 14:18:56,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-24 14:19:03,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:03,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-24 14:19:03,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:03,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-24 14:19:03,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-24 14:19:03,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 14:19:03,518 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2018-12-24 14:19:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:04,307 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2018-12-24 14:19:04,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-24 14:19:04,307 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-12-24 14:19:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:04,308 INFO L225 Difference]: With dead ends: 241 [2018-12-24 14:19:04,308 INFO L226 Difference]: Without dead ends: 161 [2018-12-24 14:19:04,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 14:19:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-24 14:19:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-12-24 14:19:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-24 14:19:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-12-24 14:19:04,313 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2018-12-24 14:19:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:04,313 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-12-24 14:19:04,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-24 14:19:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-12-24 14:19:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-24 14:19:04,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:04,314 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2018-12-24 14:19:04,315 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:04,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:04,315 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2018-12-24 14:19:04,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:04,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:04,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:04,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:04,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-24 14:19:06,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:06,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:06,690 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:06,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:06,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:06,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:06,698 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:19:06,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:19:06,813 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:19:06,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:06,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-24 14:19:06,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-24 14:19:13,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:13,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-24 14:19:13,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:13,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-24 14:19:13,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-24 14:19:13,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 14:19:13,701 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2018-12-24 14:19:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:14,573 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2018-12-24 14:19:14,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-24 14:19:14,574 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-12-24 14:19:14,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:14,574 INFO L225 Difference]: With dead ends: 244 [2018-12-24 14:19:14,575 INFO L226 Difference]: Without dead ends: 163 [2018-12-24 14:19:14,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 14:19:14,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-24 14:19:14,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-24 14:19:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-24 14:19:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-12-24 14:19:14,579 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2018-12-24 14:19:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:14,580 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-12-24 14:19:14,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-24 14:19:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-12-24 14:19:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-24 14:19:14,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:14,581 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2018-12-24 14:19:14,581 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:14,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:14,581 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2018-12-24 14:19:14,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:14,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:14,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:14,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:14,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-24 14:19:17,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:17,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:17,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:17,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:17,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:17,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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:17,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:17,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:19:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:17,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-24 14:19:17,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-24 14:19:24,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:24,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-24 14:19:24,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:24,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-24 14:19:24,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-24 14:19:24,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 14:19:24,444 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2018-12-24 14:19:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:25,290 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2018-12-24 14:19:25,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-24 14:19:25,291 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-12-24 14:19:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:25,291 INFO L225 Difference]: With dead ends: 247 [2018-12-24 14:19:25,291 INFO L226 Difference]: Without dead ends: 165 [2018-12-24 14:19:25,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 14:19:25,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-24 14:19:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-12-24 14:19:25,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-24 14:19:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-12-24 14:19:25,295 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-12-24 14:19:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:25,295 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-12-24 14:19:25,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-24 14:19:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-12-24 14:19:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-24 14:19:25,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:25,296 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2018-12-24 14:19:25,296 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:25,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:25,296 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2018-12-24 14:19:25,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:25,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:25,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:25,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:25,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-24 14:19:27,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:27,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:27,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:27,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:27,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:27,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:19:27,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:19:27,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:19:31,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-24 14:19:31,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:31,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-24 14:19:31,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-24 14:19:38,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:38,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-24 14:19:38,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:38,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-24 14:19:38,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-24 14:19:38,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 14:19:38,488 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2018-12-24 14:19:39,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:39,363 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2018-12-24 14:19:39,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-24 14:19:39,363 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-12-24 14:19:39,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:39,364 INFO L225 Difference]: With dead ends: 250 [2018-12-24 14:19:39,364 INFO L226 Difference]: Without dead ends: 167 [2018-12-24 14:19:39,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 14:19:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-24 14:19:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-12-24 14:19:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-24 14:19:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-12-24 14:19:39,369 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2018-12-24 14:19:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:39,369 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-12-24 14:19:39,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-24 14:19:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-12-24 14:19:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-24 14:19:39,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:39,370 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2018-12-24 14:19:39,370 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:39,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:39,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2018-12-24 14:19:39,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:39,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:39,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:39,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:39,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-24 14:19:42,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:42,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:42,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:42,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:42,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:42,100 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 [2018-12-24 14:19:42,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:19:42,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:19:42,227 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:19:42,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:19:42,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-24 14:19:42,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:19:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-24 14:19:49,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:19:49,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-24 14:19:49,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:19:49,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-24 14:19:49,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-24 14:19:49,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 14:19:49,575 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2018-12-24 14:19:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:19:50,300 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2018-12-24 14:19:50,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-24 14:19:50,300 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-12-24 14:19:50,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:19:50,301 INFO L225 Difference]: With dead ends: 253 [2018-12-24 14:19:50,301 INFO L226 Difference]: Without dead ends: 169 [2018-12-24 14:19:50,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 14:19:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-24 14:19:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-24 14:19:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-24 14:19:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-12-24 14:19:50,305 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2018-12-24 14:19:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:19:50,305 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-12-24 14:19:50,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-24 14:19:50,306 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-12-24 14:19:50,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-24 14:19:50,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:19:50,306 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2018-12-24 14:19:50,306 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:19:50,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:19:50,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2018-12-24 14:19:50,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:19:50,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:50,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:19:50,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:19:50,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:19:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-24 14:19:52,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:52,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:19:52,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:19:52,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:19:52,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:19:52,978 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 [2018-12-24 14:19:52,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:19:52,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:19:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:19:53,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:19:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-24 14:19:53,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-24 14:20:00,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:00,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-24 14:20:00,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:00,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-24 14:20:00,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-24 14:20:00,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 14:20:00,479 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2018-12-24 14:20:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:01,374 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2018-12-24 14:20:01,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-24 14:20:01,375 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-12-24 14:20:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:01,375 INFO L225 Difference]: With dead ends: 256 [2018-12-24 14:20:01,376 INFO L226 Difference]: Without dead ends: 171 [2018-12-24 14:20:01,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 14:20:01,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-24 14:20:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-24 14:20:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-24 14:20:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-12-24 14:20:01,379 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-12-24 14:20:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:01,379 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-12-24 14:20:01,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-24 14:20:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-12-24 14:20:01,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-24 14:20:01,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:01,380 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2018-12-24 14:20:01,380 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:01,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:01,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2018-12-24 14:20:01,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:01,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:01,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:01,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:01,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-24 14:20:04,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:04,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:04,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:04,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:04,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:04,029 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 [2018-12-24 14:20:04,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:20:04,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:20:14,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-24 14:20:14,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:14,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-24 14:20:14,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-24 14:20:22,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:22,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-24 14:20:22,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:22,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-24 14:20:22,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-24 14:20:22,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 14:20:22,336 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2018-12-24 14:20:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:23,358 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2018-12-24 14:20:23,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-24 14:20:23,358 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-12-24 14:20:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:23,359 INFO L225 Difference]: With dead ends: 259 [2018-12-24 14:20:23,359 INFO L226 Difference]: Without dead ends: 173 [2018-12-24 14:20:23,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 14:20:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-24 14:20:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-12-24 14:20:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-24 14:20:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-12-24 14:20:23,363 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2018-12-24 14:20:23,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:23,363 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-12-24 14:20:23,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-24 14:20:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-12-24 14:20:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-24 14:20:23,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:23,365 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2018-12-24 14:20:23,365 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:23,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:23,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2018-12-24 14:20:23,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:23,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:23,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:20:23,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:23,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-24 14:20:25,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:25,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:25,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:25,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:25,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:25,962 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 [2018-12-24 14:20:25,971 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:20:25,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:20:26,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:20:26,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:20:26,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-24 14:20:26,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-24 14:20:34,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:34,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-24 14:20:34,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:34,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-24 14:20:34,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-24 14:20:34,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 14:20:34,252 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2018-12-24 14:20:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:35,296 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2018-12-24 14:20:35,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-24 14:20:35,296 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-12-24 14:20:35,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:35,297 INFO L225 Difference]: With dead ends: 262 [2018-12-24 14:20:35,297 INFO L226 Difference]: Without dead ends: 175 [2018-12-24 14:20:35,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 14:20:35,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-24 14:20:35,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-24 14:20:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-24 14:20:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-12-24 14:20:35,302 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2018-12-24 14:20:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:35,302 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-12-24 14:20:35,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-24 14:20:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-12-24 14:20:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-24 14:20:35,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:35,304 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2018-12-24 14:20:35,304 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:35,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:35,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2018-12-24 14:20:35,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:35,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:35,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:20:35,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:35,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-24 14:20:38,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:38,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:38,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:38,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:38,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:38,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 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 [2018-12-24 14:20:38,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:38,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:20:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:38,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:20:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-24 14:20:38,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:20:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-24 14:20:46,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:20:46,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-24 14:20:46,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:20:46,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-24 14:20:46,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-24 14:20:46,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 14:20:46,470 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2018-12-24 14:20:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:20:47,479 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2018-12-24 14:20:47,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-24 14:20:47,479 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-12-24 14:20:47,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:20:47,480 INFO L225 Difference]: With dead ends: 265 [2018-12-24 14:20:47,480 INFO L226 Difference]: Without dead ends: 177 [2018-12-24 14:20:47,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 14:20:47,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-24 14:20:47,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-12-24 14:20:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-24 14:20:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-12-24 14:20:47,484 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-12-24 14:20:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:20:47,485 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-12-24 14:20:47,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-24 14:20:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-12-24 14:20:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-24 14:20:47,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:20:47,486 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2018-12-24 14:20:47,486 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:20:47,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:20:47,486 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2018-12-24 14:20:47,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:20:47,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:47,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:20:47,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:20:47,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:20:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:20:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-24 14:20:50,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:50,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:20:50,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:20:50,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:20:50,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:20:50,254 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 [2018-12-24 14:20:50,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:20:50,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:21:00,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-24 14:21:00,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:21:00,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-24 14:21:00,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-24 14:21:09,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:09,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-24 14:21:09,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:09,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-24 14:21:09,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-24 14:21:09,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 14:21:09,412 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2018-12-24 14:21:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:10,291 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2018-12-24 14:21:10,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-24 14:21:10,292 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-12-24 14:21:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:10,293 INFO L225 Difference]: With dead ends: 268 [2018-12-24 14:21:10,293 INFO L226 Difference]: Without dead ends: 179 [2018-12-24 14:21:10,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 14:21:10,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-24 14:21:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-12-24 14:21:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-24 14:21:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-12-24 14:21:10,298 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2018-12-24 14:21:10,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:10,298 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-12-24 14:21:10,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-24 14:21:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-12-24 14:21:10,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-24 14:21:10,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:10,299 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2018-12-24 14:21:10,299 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:21:10,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:10,299 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2018-12-24 14:21:10,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:10,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:10,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:21:10,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:10,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-24 14:21:13,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:13,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:13,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:13,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:13,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:13,417 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 [2018-12-24 14:21:13,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:21:13,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:21:13,568 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:21:13,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:21:13,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-24 14:21:13,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-24 14:21:21,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:21,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-24 14:21:21,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:21,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-24 14:21:21,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-24 14:21:21,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 14:21:21,866 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2018-12-24 14:21:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:22,947 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2018-12-24 14:21:22,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-24 14:21:22,947 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-12-24 14:21:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:22,948 INFO L225 Difference]: With dead ends: 271 [2018-12-24 14:21:22,948 INFO L226 Difference]: Without dead ends: 181 [2018-12-24 14:21:22,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 14:21:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-24 14:21:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-24 14:21:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-24 14:21:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-12-24 14:21:22,952 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2018-12-24 14:21:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:22,952 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-12-24 14:21:22,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-24 14:21:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-12-24 14:21:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-24 14:21:22,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:22,953 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2018-12-24 14:21:22,953 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:21:22,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:22,953 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2018-12-24 14:21:22,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:22,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:22,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:21:22,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:22,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-24 14:21:25,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:25,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:25,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:25,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:25,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:25,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 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 [2018-12-24 14:21:25,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:21:25,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:21:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:25,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-24 14:21:25,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:34,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-24 14:21:34,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:34,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-24 14:21:34,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:34,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-24 14:21:34,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-24 14:21:34,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 14:21:34,726 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2018-12-24 14:21:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:35,665 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2018-12-24 14:21:35,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-24 14:21:35,665 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-12-24 14:21:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:35,666 INFO L225 Difference]: With dead ends: 274 [2018-12-24 14:21:35,666 INFO L226 Difference]: Without dead ends: 183 [2018-12-24 14:21:35,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 14:21:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-24 14:21:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-12-24 14:21:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-24 14:21:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-12-24 14:21:35,670 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-12-24 14:21:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:35,670 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-12-24 14:21:35,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-24 14:21:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-12-24 14:21:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-24 14:21:35,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:35,671 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2018-12-24 14:21:35,671 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:21:35,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:35,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2018-12-24 14:21:35,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:35,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:35,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:21:35,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:35,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-24 14:21:38,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:38,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:38,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:38,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:38,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:38,929 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 [2018-12-24 14:21:38,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:21:38,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:21:44,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-24 14:21:44,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:21:44,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-24 14:21:44,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:21:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-24 14:21:53,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:21:53,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-24 14:21:53,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:21:53,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-24 14:21:53,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-24 14:21:53,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 14:21:53,633 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2018-12-24 14:21:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:21:54,568 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2018-12-24 14:21:54,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-24 14:21:54,569 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-12-24 14:21:54,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:21:54,569 INFO L225 Difference]: With dead ends: 277 [2018-12-24 14:21:54,569 INFO L226 Difference]: Without dead ends: 185 [2018-12-24 14:21:54,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 14:21:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-24 14:21:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-12-24 14:21:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-24 14:21:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-12-24 14:21:54,573 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2018-12-24 14:21:54,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:21:54,574 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-12-24 14:21:54,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-24 14:21:54,574 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-12-24 14:21:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-24 14:21:54,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:21:54,575 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2018-12-24 14:21:54,575 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:21:54,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:21:54,575 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2018-12-24 14:21:54,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:21:54,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:54,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:21:54,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:21:54,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:21:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:21:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-24 14:21:57,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:57,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:21:57,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:21:57,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:21:57,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:21:57,678 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 [2018-12-24 14:21:57,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:21:57,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:21:57,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:21:57,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:21:57,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:21:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-24 14:21:57,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-24 14:22:07,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:07,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-24 14:22:07,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:07,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-24 14:22:07,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-24 14:22:07,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 14:22:07,031 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2018-12-24 14:22:07,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:07,987 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2018-12-24 14:22:07,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-24 14:22:07,988 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-12-24 14:22:07,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:07,988 INFO L225 Difference]: With dead ends: 280 [2018-12-24 14:22:07,988 INFO L226 Difference]: Without dead ends: 187 [2018-12-24 14:22:07,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 14:22:07,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-24 14:22:07,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-24 14:22:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-24 14:22:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-12-24 14:22:07,994 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2018-12-24 14:22:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:07,994 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-12-24 14:22:07,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-24 14:22:07,994 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-12-24 14:22:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-24 14:22:07,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:07,995 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2018-12-24 14:22:07,995 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:22:07,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:07,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2018-12-24 14:22:07,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:07,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:07,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:22:07,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:07,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-24 14:22:11,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:11,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:11,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:11,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:11,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:11,387 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 [2018-12-24 14:22:11,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:22:11,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:22:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:11,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-24 14:22:11,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-24 14:22:20,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:20,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-24 14:22:20,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:20,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-24 14:22:20,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-24 14:22:20,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 14:22:20,841 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2018-12-24 14:22:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:22,215 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2018-12-24 14:22:22,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-24 14:22:22,215 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-12-24 14:22:22,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:22,216 INFO L225 Difference]: With dead ends: 283 [2018-12-24 14:22:22,216 INFO L226 Difference]: Without dead ends: 189 [2018-12-24 14:22:22,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 14:22:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-24 14:22:22,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-12-24 14:22:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-24 14:22:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-12-24 14:22:22,221 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-12-24 14:22:22,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:22,221 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-12-24 14:22:22,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-24 14:22:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-12-24 14:22:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-24 14:22:22,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:22,223 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2018-12-24 14:22:22,223 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:22:22,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:22,223 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2018-12-24 14:22:22,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:22,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:22,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:22:22,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:22,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-24 14:22:25,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:25,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:25,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:25,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:25,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:25,758 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 [2018-12-24 14:22:25,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:22:25,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:22:31,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-24 14:22:31,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:22:31,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-24 14:22:31,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-24 14:22:41,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:41,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-24 14:22:41,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:41,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-24 14:22:41,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-24 14:22:41,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 14:22:41,472 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2018-12-24 14:22:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:42,643 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2018-12-24 14:22:42,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-24 14:22:42,643 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-12-24 14:22:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:42,644 INFO L225 Difference]: With dead ends: 286 [2018-12-24 14:22:42,644 INFO L226 Difference]: Without dead ends: 191 [2018-12-24 14:22:42,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 14:22:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-24 14:22:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-12-24 14:22:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-24 14:22:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-12-24 14:22:42,648 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2018-12-24 14:22:42,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:42,648 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-12-24 14:22:42,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-24 14:22:42,648 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-12-24 14:22:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-24 14:22:42,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:42,649 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2018-12-24 14:22:42,649 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:22:42,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:42,650 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2018-12-24 14:22:42,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:42,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:42,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:22:42,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:42,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:22:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-24 14:22:46,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:46,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:22:46,068 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:22:46,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:22:46,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:22:46,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 14:22:46,076 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:22:46,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:22:46,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:22:46,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:22:46,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:22:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-24 14:22:46,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:22:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-24 14:22:55,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:22:55,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-24 14:22:55,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:22:55,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-24 14:22:55,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-24 14:22:55,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 14:22:55,879 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2018-12-24 14:22:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:22:57,299 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2018-12-24 14:22:57,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-24 14:22:57,300 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-12-24 14:22:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:22:57,301 INFO L225 Difference]: With dead ends: 289 [2018-12-24 14:22:57,301 INFO L226 Difference]: Without dead ends: 193 [2018-12-24 14:22:57,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 14:22:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-24 14:22:57,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-12-24 14:22:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-24 14:22:57,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-12-24 14:22:57,305 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2018-12-24 14:22:57,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:22:57,305 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-12-24 14:22:57,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-24 14:22:57,306 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-12-24 14:22:57,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-24 14:22:57,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:22:57,307 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2018-12-24 14:22:57,307 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:22:57,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:22:57,307 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2018-12-24 14:22:57,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:22:57,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:57,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:22:57,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:22:57,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:22:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-24 14:23:00,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:00,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:00,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:00,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:00,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:00,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 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 [2018-12-24 14:23:00,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:23:00,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:23:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:01,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-24 14:23:01,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-24 14:23:11,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:11,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-24 14:23:11,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:11,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-24 14:23:11,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-24 14:23:11,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 14:23:11,035 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2018-12-24 14:23:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:12,483 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2018-12-24 14:23:12,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-24 14:23:12,484 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-12-24 14:23:12,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:12,485 INFO L225 Difference]: With dead ends: 292 [2018-12-24 14:23:12,485 INFO L226 Difference]: Without dead ends: 195 [2018-12-24 14:23:12,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 14:23:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-24 14:23:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-12-24 14:23:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-24 14:23:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-12-24 14:23:12,490 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-12-24 14:23:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:12,490 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-12-24 14:23:12,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-24 14:23:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-12-24 14:23:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-24 14:23:12,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:12,491 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2018-12-24 14:23:12,491 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:23:12,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:12,492 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2018-12-24 14:23:12,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:12,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:12,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:23:12,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:12,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-24 14:23:16,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:16,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:16,059 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:16,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:16,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:16,059 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 [2018-12-24 14:23:16,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:23:16,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:23:23,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-24 14:23:23,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:23:23,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-24 14:23:23,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-24 14:23:33,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:33,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-24 14:23:33,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:33,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-24 14:23:33,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-24 14:23:33,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 14:23:33,486 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2018-12-24 14:23:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:35,133 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2018-12-24 14:23:35,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-24 14:23:35,134 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-12-24 14:23:35,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:35,135 INFO L225 Difference]: With dead ends: 295 [2018-12-24 14:23:35,135 INFO L226 Difference]: Without dead ends: 197 [2018-12-24 14:23:35,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 14:23:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-24 14:23:35,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-12-24 14:23:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-24 14:23:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-12-24 14:23:35,139 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2018-12-24 14:23:35,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:35,140 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-12-24 14:23:35,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-24 14:23:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-12-24 14:23:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-24 14:23:35,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:35,141 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2018-12-24 14:23:35,141 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:23:35,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2018-12-24 14:23:35,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:35,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:35,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:23:35,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:35,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-24 14:23:38,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:38,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:38,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:38,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:38,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:38,829 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 [2018-12-24 14:23:38,839 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:23:38,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:23:38,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:23:38,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:23:38,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-24 14:23:39,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:23:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-24 14:23:49,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:23:49,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-24 14:23:49,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:23:49,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-24 14:23:49,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-24 14:23:49,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 14:23:49,345 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2018-12-24 14:23:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:23:50,945 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2018-12-24 14:23:50,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-24 14:23:50,945 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-12-24 14:23:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:23:50,946 INFO L225 Difference]: With dead ends: 298 [2018-12-24 14:23:50,946 INFO L226 Difference]: Without dead ends: 199 [2018-12-24 14:23:50,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 14:23:50,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-24 14:23:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-12-24 14:23:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-24 14:23:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-12-24 14:23:50,949 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2018-12-24 14:23:50,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:23:50,949 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-12-24 14:23:50,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-24 14:23:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-12-24 14:23:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-24 14:23:50,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:23:50,950 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2018-12-24 14:23:50,950 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:23:50,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:23:50,951 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2018-12-24 14:23:50,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:23:50,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:50,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:23:50,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:23:50,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:23:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-24 14:23:54,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:54,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:23:54,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:23:54,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:23:54,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:23:54,650 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 [2018-12-24 14:23:54,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:23:54,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:23:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:23:54,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:23:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-24 14:23:54,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-24 14:24:05,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:05,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-24 14:24:05,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:05,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-24 14:24:05,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-24 14:24:05,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 14:24:05,419 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2018-12-24 14:24:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:06,635 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2018-12-24 14:24:06,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-24 14:24:06,635 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-12-24 14:24:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:06,636 INFO L225 Difference]: With dead ends: 301 [2018-12-24 14:24:06,636 INFO L226 Difference]: Without dead ends: 201 [2018-12-24 14:24:06,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 14:24:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-24 14:24:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-12-24 14:24:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-24 14:24:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-12-24 14:24:06,640 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2018-12-24 14:24:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:06,640 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-12-24 14:24:06,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-24 14:24:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-12-24 14:24:06,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-24 14:24:06,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:06,641 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2018-12-24 14:24:06,641 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:24:06,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:06,642 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2018-12-24 14:24:06,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:06,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:06,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:24:06,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:06,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-24 14:24:10,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:10,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:24:10,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:24:10,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:24:10,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:10,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 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 [2018-12-24 14:24:10,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:24:10,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:24:27,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-24 14:24:27,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:24:27,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:24:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-24 14:24:27,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-24 14:24:38,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:38,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-24 14:24:38,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:38,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-24 14:24:38,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-24 14:24:38,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 14:24:38,060 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2018-12-24 14:24:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:39,801 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2018-12-24 14:24:39,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-24 14:24:39,802 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-12-24 14:24:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:39,803 INFO L225 Difference]: With dead ends: 304 [2018-12-24 14:24:39,803 INFO L226 Difference]: Without dead ends: 203 [2018-12-24 14:24:39,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 14:24:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-24 14:24:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-12-24 14:24:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-24 14:24:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-12-24 14:24:39,807 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2018-12-24 14:24:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:39,807 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-12-24 14:24:39,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-24 14:24:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-12-24 14:24:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-24 14:24:39,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:39,808 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2018-12-24 14:24:39,808 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:24:39,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:39,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2018-12-24 14:24:39,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:39,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:39,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:24:39,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:39,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:24:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-24 14:24:43,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:43,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:24:43,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:24:43,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:24:43,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:24:43,650 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 [2018-12-24 14:24:43,659 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:24:43,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:24:43,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:24:43,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:24:43,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:24:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-24 14:24:43,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:24:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-24 14:24:54,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:24:54,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-24 14:24:54,819 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:24:54,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-24 14:24:54,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-24 14:24:54,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 14:24:54,822 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2018-12-24 14:24:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:24:56,558 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2018-12-24 14:24:56,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-24 14:24:56,558 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-12-24 14:24:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:24:56,559 INFO L225 Difference]: With dead ends: 307 [2018-12-24 14:24:56,559 INFO L226 Difference]: Without dead ends: 205 [2018-12-24 14:24:56,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 14:24:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-24 14:24:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-12-24 14:24:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-24 14:24:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-12-24 14:24:56,563 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2018-12-24 14:24:56,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:24:56,563 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-12-24 14:24:56,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-24 14:24:56,563 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-12-24 14:24:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-24 14:24:56,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:24:56,564 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2018-12-24 14:24:56,564 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:24:56,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:24:56,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2018-12-24 14:24:56,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:24:56,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:56,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:24:56,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:24:56,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:24:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-24 14:25:00,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:00,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:25:00,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:25:00,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:25:00,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:00,636 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 [2018-12-24 14:25:00,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:25:00,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:25:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:00,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:25:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-24 14:25:00,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:25:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-24 14:25:12,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:25:12,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-24 14:25:12,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:25:12,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-24 14:25:12,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-24 14:25:12,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-24 14:25:12,107 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2018-12-24 14:25:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:25:13,788 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2018-12-24 14:25:13,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-24 14:25:13,788 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-12-24 14:25:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:25:13,789 INFO L225 Difference]: With dead ends: 310 [2018-12-24 14:25:13,789 INFO L226 Difference]: Without dead ends: 207 [2018-12-24 14:25:13,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-24 14:25:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-24 14:25:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-12-24 14:25:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-24 14:25:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-12-24 14:25:13,795 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2018-12-24 14:25:13,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:25:13,795 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-12-24 14:25:13,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-24 14:25:13,796 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-12-24 14:25:13,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-24 14:25:13,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:25:13,797 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2018-12-24 14:25:13,797 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:25:13,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:25:13,797 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2018-12-24 14:25:13,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:25:13,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:13,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:25:13,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:13,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:25:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-24 14:25:17,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:17,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:25:17,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:25:17,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:25:17,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:17,565 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 [2018-12-24 14:25:17,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:25:17,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:25:38,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-24 14:25:38,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:25:38,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:25:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-24 14:25:38,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:25:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-24 14:25:50,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:25:50,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-24 14:25:50,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:25:50,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-24 14:25:50,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-24 14:25:50,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-24 14:25:50,242 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2018-12-24 14:25:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:25:52,204 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2018-12-24 14:25:52,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-24 14:25:52,204 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-12-24 14:25:52,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:25:52,206 INFO L225 Difference]: With dead ends: 313 [2018-12-24 14:25:52,206 INFO L226 Difference]: Without dead ends: 209 [2018-12-24 14:25:52,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-24 14:25:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-24 14:25:52,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-12-24 14:25:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-24 14:25:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-12-24 14:25:52,211 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2018-12-24 14:25:52,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:25:52,212 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-12-24 14:25:52,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-24 14:25:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-12-24 14:25:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-24 14:25:52,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:25:52,213 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2018-12-24 14:25:52,213 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:25:52,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:25:52,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2018-12-24 14:25:52,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:25:52,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:52,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:25:52,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:25:52,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:25:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:25:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2018-12-24 14:25:56,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:56,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:25:56,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:25:56,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:25:56,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:25:56,354 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 [2018-12-24 14:25:56,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:25:56,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:25:56,507 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:25:56,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:25:56,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:25:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2018-12-24 14:25:56,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2018-12-24 14:26:08,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:08,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-24 14:26:08,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:08,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-24 14:26:08,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-24 14:26:08,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-24 14:26:08,180 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2018-12-24 14:26:09,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:09,714 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2018-12-24 14:26:09,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-24 14:26:09,715 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-12-24 14:26:09,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:09,715 INFO L225 Difference]: With dead ends: 316 [2018-12-24 14:26:09,716 INFO L226 Difference]: Without dead ends: 211 [2018-12-24 14:26:09,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-24 14:26:09,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-24 14:26:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-24 14:26:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-24 14:26:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-12-24 14:26:09,721 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2018-12-24 14:26:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:09,722 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-12-24 14:26:09,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-24 14:26:09,722 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-12-24 14:26:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-24 14:26:09,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:09,723 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2018-12-24 14:26:09,723 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:09,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:09,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2018-12-24 14:26:09,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:09,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:09,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:09,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:09,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2018-12-24 14:26:13,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:13,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:13,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:13,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:13,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:13,744 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 [2018-12-24 14:26:13,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:13,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:26:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:13,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2018-12-24 14:26:13,969 INFO L316 TraceCheckSpWp]: Computing backward predicates...