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/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:37:48,209 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:37:48,211 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:37:48,223 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:37:48,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:37:48,224 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:37:48,226 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:37:48,227 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:37:48,229 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:37:48,230 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:37:48,231 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:37:48,231 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:37:48,232 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:37:48,233 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:37:48,234 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:37:48,235 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:37:48,236 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:37:48,238 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:37:48,240 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:37:48,242 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:37:48,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:37:48,244 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:37:48,247 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:37:48,247 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:37:48,247 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:37:48,248 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:37:48,249 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:37:48,250 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:37:48,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:37:48,251 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:37:48,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:37:48,252 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:37:48,253 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:37:48,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:37:48,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:37:48,254 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:37:48,255 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-28 10:37:48,278 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:37:48,278 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:37:48,279 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:37:48,279 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:37:48,279 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:37:48,279 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:37:48,280 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:37:48,280 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:37:48,280 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:37:48,280 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:37:48,281 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:37:48,281 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:37:48,281 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:37:48,282 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:37:48,283 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:37:48,283 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:37:48,283 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:37:48,283 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:37:48,283 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:37:48,284 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:37:48,284 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:37:48,284 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:37:48,284 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:37:48,284 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:37:48,285 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:37:48,286 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:37:48,286 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:37:48,287 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:37:48,288 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:37:48,288 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:37:48,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:37:48,288 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:37:48,288 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:37:48,289 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:37:48,289 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:37:48,289 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:37:48,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:37:48,289 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:37:48,289 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:37:48,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:37:48,336 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:37:48,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:37:48,343 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:37:48,344 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:37:48,344 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2019-02-28 10:37:48,345 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2019-02-28 10:37:48,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:37:48,382 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:37:48,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:37:48,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:37:48,383 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:37:48,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,415 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-28 10:37:48,415 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-28 10:37:48,416 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-28 10:37:48,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:37:48,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:37:48,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:37:48,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:37:48,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:37:48,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:37:48,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:37:48,440 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:37:48,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:37:48,498 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-28 10:37:48,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-28 10:37:48,498 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-28 10:37:48,682 INFO L278 CfgBuilder]: Using library mode [2019-02-28 10:37:48,682 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-28 10:37:48,684 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:37:48 BoogieIcfgContainer [2019-02-28 10:37:48,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:37:48,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:37:48,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:37:48,694 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:37:48,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/2) ... [2019-02-28 10:37:48,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79de26e1 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:37:48, skipping insertion in model container [2019-02-28 10:37:48,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:37:48" (2/2) ... [2019-02-28 10:37:48,698 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2019-02-28 10:37:48,708 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:37:48,719 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 10:37:48,739 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 10:37:48,780 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:37:48,780 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:37:48,780 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:37:48,781 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:37:48,781 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:37:48,781 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:37:48,781 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:37:48,781 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:37:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-28 10:37:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:37:48,809 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:48,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:37:48,812 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:48,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:48,823 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-02-28 10:37:48,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:48,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:48,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:48,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:48,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:49,617 WARN L181 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-02-28 10:37:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:49,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:37:49,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:37:49,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:37:49,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:37:49,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:37:49,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:37:49,678 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-02-28 10:37:49,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:49,750 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-28 10:37:49,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:37:49,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 10:37:49,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:49,763 INFO L225 Difference]: With dead ends: 14 [2019-02-28 10:37:49,764 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 10:37:49,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:37:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 10:37:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-02-28 10:37:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 10:37:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-28 10:37:49,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-02-28 10:37:49,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:49,806 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-28 10:37:49,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:37:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-28 10:37:49,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:37:49,807 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:49,807 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-28 10:37:49,808 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:49,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:49,808 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-02-28 10:37:49,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:49,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:49,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:50,152 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:37:50,442 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-02-28 10:37:50,669 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-02-28 10:37:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:50,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:50,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:50,730 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:37:50,731 INFO L207 CegarAbsIntRunner]: [0], [4], [5], [6] [2019-02-28 10:37:50,792 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:37:50,792 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:37:51,369 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:37:51,371 INFO L272 AbstractInterpreter]: Visited 4 different actions 25 times. Merged at 3 different actions 21 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:37:51,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:51,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:37:51,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:51,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:51,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:51,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:37:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:51,504 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:37:51,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:51,554 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:37:51,555 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:51,579 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:51,580 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:37:51,681 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:37:51,682 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:51,770 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:51,770 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:37:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:51,826 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:52,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:52,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:37:52,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:52,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:37:52,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:37:52,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:37:52,027 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2019-02-28 10:37:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:52,372 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-28 10:37:52,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:37:52,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-28 10:37:52,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:52,373 INFO L225 Difference]: With dead ends: 10 [2019-02-28 10:37:52,373 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 10:37:52,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:37:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 10:37:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-02-28 10:37:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:37:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-28 10:37:52,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-02-28 10:37:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:52,377 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-28 10:37:52,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:37:52,378 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 10:37:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:37:52,378 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:52,378 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-02-28 10:37:52,379 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:52,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:52,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-02-28 10:37:52,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:52,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:52,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:52,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:52,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:52,530 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:37:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:52,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:52,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:52,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:52,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:52,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:52,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:52,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:37:52,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:37:52,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:37:52,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:52,872 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:37:52,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:52,877 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:37:52,877 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:52,902 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:52,903 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:37:52,994 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:37:52,995 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:53,004 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:53,005 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:37:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:53,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:53,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:53,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-28 10:37:53,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:53,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:37:53,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:37:53,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:37:53,296 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2019-02-28 10:37:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:53,384 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-28 10:37:53,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:37:53,385 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-28 10:37:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:53,385 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:37:53,385 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:37:53,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:37:53,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:37:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-02-28 10:37:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 10:37:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-28 10:37:53,390 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-02-28 10:37:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:53,390 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-28 10:37:53,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:37:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-28 10:37:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:37:53,391 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:53,391 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-02-28 10:37:53,391 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:53,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:53,392 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-02-28 10:37:53,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:53,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:53,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:53,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:53,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:53,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:53,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:53,708 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:53,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:53,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:53,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:53,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:37:53,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:37:53,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:37:53,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:53,727 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:37:53,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:53,732 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:37:53,732 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:53,747 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:53,748 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:37:54,044 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:37:54,045 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:54,052 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:54,053 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:37:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:54,064 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:54,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:54,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-28 10:37:54,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:54,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:37:54,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:37:54,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:37:54,245 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2019-02-28 10:37:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:54,387 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-28 10:37:54,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:37:54,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-28 10:37:54,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:54,389 INFO L225 Difference]: With dead ends: 14 [2019-02-28 10:37:54,389 INFO L226 Difference]: Without dead ends: 13 [2019-02-28 10:37:54,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:37:54,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-28 10:37:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-02-28 10:37:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 10:37:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-28 10:37:54,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-02-28 10:37:54,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:54,393 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-28 10:37:54,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:37:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-28 10:37:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-28 10:37:54,394 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:54,394 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-02-28 10:37:54,394 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:54,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:54,395 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-02-28 10:37:54,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:54,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:54,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:54,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:54,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:54,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:54,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:54,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:54,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:54,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:54,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:54,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:54,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:37:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:54,744 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:37:54,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:54,758 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:37:54,759 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:54,774 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:54,774 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:37:54,909 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:37:54,910 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:54,916 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:54,916 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:37:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:54,925 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:55,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:55,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2019-02-28 10:37:55,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:55,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-28 10:37:55,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-28 10:37:55,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:37:55,134 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2019-02-28 10:37:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:55,428 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-02-28 10:37:55,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:37:55,429 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2019-02-28 10:37:55,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:55,430 INFO L225 Difference]: With dead ends: 16 [2019-02-28 10:37:55,430 INFO L226 Difference]: Without dead ends: 15 [2019-02-28 10:37:55,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:37:55,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-28 10:37:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-02-28 10:37:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-28 10:37:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-02-28 10:37:55,434 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-02-28 10:37:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:55,435 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-02-28 10:37:55,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-28 10:37:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-02-28 10:37:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-28 10:37:55,436 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:55,436 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-02-28 10:37:55,436 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:55,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:55,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-02-28 10:37:55,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:55,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:55,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:55,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:55,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:55,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:55,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:55,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:55,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:55,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:55,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:55,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:37:55,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:37:55,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-28 10:37:55,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:55,846 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-28 10:37:55,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:55,851 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:37:55,851 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:55,861 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:55,862 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:37:56,032 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:37:56,033 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:56,038 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:56,039 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:37:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:56,049 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:56,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:56,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2019-02-28 10:37:56,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:56,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-28 10:37:56,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-28 10:37:56,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-02-28 10:37:56,346 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2019-02-28 10:37:56,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:56,483 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-28 10:37:56,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:37:56,483 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-02-28 10:37:56,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:56,484 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:37:56,485 INFO L226 Difference]: Without dead ends: 17 [2019-02-28 10:37:56,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-02-28 10:37:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-28 10:37:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-28 10:37:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:37:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-28 10:37:56,490 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-02-28 10:37:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:56,490 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-28 10:37:56,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-28 10:37:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-28 10:37:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-28 10:37:56,491 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:56,491 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-02-28 10:37:56,491 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:56,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:56,491 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-02-28 10:37:56,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:56,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:56,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:56,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:56,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:56,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:56,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:56,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:56,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:56,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:56,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:56,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:37:56,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:37:56,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:37:56,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:56,952 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-28 10:37:56,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:56,960 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:37:56,961 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:56,968 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:56,968 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:37:57,125 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:37:57,126 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:57,131 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:57,132 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:37:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:57,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:57,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:57,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2019-02-28 10:37:57,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:57,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-28 10:37:57,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-28 10:37:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:37:57,444 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2019-02-28 10:37:57,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:57,723 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-28 10:37:57,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:37:57,723 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-02-28 10:37:57,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:57,724 INFO L225 Difference]: With dead ends: 20 [2019-02-28 10:37:57,724 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:37:57,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:37:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:37:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-02-28 10:37:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-28 10:37:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-02-28 10:37:57,729 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-02-28 10:37:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:57,729 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-02-28 10:37:57,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-28 10:37:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-02-28 10:37:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-02-28 10:37:57,730 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:57,730 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-02-28 10:37:57,730 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:57,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-02-28 10:37:57,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:57,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:57,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:57,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:57,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:58,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:58,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:58,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:58,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:58,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:58,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:58,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:58,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:37:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:58,162 WARN L254 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-28 10:37:58,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:58,166 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:37:58,166 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:58,172 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:58,173 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:37:58,361 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:37:58,363 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:58,377 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:58,377 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:37:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:58,391 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:58,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:58,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2019-02-28 10:37:58,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:58,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-28 10:37:58,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-28 10:37:58,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-02-28 10:37:58,691 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2019-02-28 10:37:59,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:59,068 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-02-28 10:37:59,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:37:59,069 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2019-02-28 10:37:59,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:59,070 INFO L225 Difference]: With dead ends: 22 [2019-02-28 10:37:59,070 INFO L226 Difference]: Without dead ends: 21 [2019-02-28 10:37:59,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-02-28 10:37:59,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-28 10:37:59,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-02-28 10:37:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-28 10:37:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-02-28 10:37:59,076 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-02-28 10:37:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:59,077 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-02-28 10:37:59,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-28 10:37:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-02-28 10:37:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-28 10:37:59,078 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:59,078 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-02-28 10:37:59,078 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-02-28 10:37:59,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:59,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:59,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:59,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:59,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:59,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:59,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:59,451 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:59,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:59,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:59,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:59,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:37:59,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:37:59,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-28 10:37:59,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:59,475 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 23 conjunts are in the unsatisfiable core [2019-02-28 10:37:59,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:59,482 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:37:59,482 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:59,489 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:59,490 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:37:59,690 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:37:59,691 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:59,700 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:59,701 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:37:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:59,714 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:00,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:00,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2019-02-28 10:38:00,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:00,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-28 10:38:00,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-28 10:38:00,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:38:00,155 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2019-02-28 10:38:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:00,498 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-28 10:38:00,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-28 10:38:00,499 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2019-02-28 10:38:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:00,500 INFO L225 Difference]: With dead ends: 24 [2019-02-28 10:38:00,500 INFO L226 Difference]: Without dead ends: 23 [2019-02-28 10:38:00,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:38:00,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-28 10:38:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-02-28 10:38:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-28 10:38:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-28 10:38:00,506 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-02-28 10:38:00,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:00,507 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-28 10:38:00,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-28 10:38:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-28 10:38:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-28 10:38:00,507 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:00,508 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-02-28 10:38:00,508 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:00,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-02-28 10:38:00,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:00,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:00,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:00,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:00,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:00,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:00,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:00,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:00,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:00,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:00,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:00,939 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:00,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:00,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:00,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:00,950 WARN L254 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-28 10:38:00,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:00,954 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:00,955 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:00,974 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:00,974 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:01,269 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:01,271 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:01,275 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:01,275 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:01,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:01,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:01,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2019-02-28 10:38:01,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:01,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-28 10:38:01,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-28 10:38:01,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-02-28 10:38:01,657 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2019-02-28 10:38:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:01,948 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-28 10:38:01,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-28 10:38:01,949 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-02-28 10:38:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:01,950 INFO L225 Difference]: With dead ends: 26 [2019-02-28 10:38:01,950 INFO L226 Difference]: Without dead ends: 25 [2019-02-28 10:38:01,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-02-28 10:38:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-28 10:38:01,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-02-28 10:38:01,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-28 10:38:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-02-28 10:38:01,956 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-02-28 10:38:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:01,956 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-02-28 10:38:01,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-28 10:38:01,956 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-02-28 10:38:01,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-28 10:38:01,957 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:01,957 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-02-28 10:38:01,957 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:01,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:01,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-02-28 10:38:01,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:01,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:01,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:01,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:01,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:02,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:02,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:02,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:02,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:02,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:02,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:02,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:02,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:02,438 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-28 10:38:02,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:02,458 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:02,459 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:02,462 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:02,463 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:02,901 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:02,902 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:02,911 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:02,911 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:02,953 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:03,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:03,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2019-02-28 10:38:03,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:03,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-28 10:38:03,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-28 10:38:03,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:38:03,562 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2019-02-28 10:38:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:03,881 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-02-28 10:38:03,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-28 10:38:03,881 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2019-02-28 10:38:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:03,883 INFO L225 Difference]: With dead ends: 28 [2019-02-28 10:38:03,883 INFO L226 Difference]: Without dead ends: 27 [2019-02-28 10:38:03,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:38:03,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-28 10:38:03,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-02-28 10:38:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-28 10:38:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-28 10:38:03,889 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-02-28 10:38:03,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:03,889 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-28 10:38:03,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-28 10:38:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-28 10:38:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-28 10:38:03,890 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:03,890 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-02-28 10:38:03,890 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:03,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:03,890 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-02-28 10:38:03,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:03,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:03,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:03,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:03,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:04,257 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:38:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:04,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:04,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:04,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:04,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:04,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:04,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:04,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:04,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:04,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-28 10:38:04,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:04,652 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-28 10:38:04,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:04,656 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:04,657 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:04,665 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:04,666 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:04,971 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:04,972 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:04,978 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:04,978 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:04,998 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:04,998 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:05,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:05,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2019-02-28 10:38:05,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:05,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-28 10:38:05,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-28 10:38:05,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-02-28 10:38:05,589 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2019-02-28 10:38:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:05,920 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-28 10:38:05,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-28 10:38:05,922 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2019-02-28 10:38:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:05,923 INFO L225 Difference]: With dead ends: 30 [2019-02-28 10:38:05,923 INFO L226 Difference]: Without dead ends: 29 [2019-02-28 10:38:05,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-02-28 10:38:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-28 10:38:05,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-02-28 10:38:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-28 10:38:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-28 10:38:05,929 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-02-28 10:38:05,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:05,929 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-28 10:38:05,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-28 10:38:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-28 10:38:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-28 10:38:05,930 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:05,930 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-02-28 10:38:05,930 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:05,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:05,931 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-02-28 10:38:05,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:05,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:05,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:05,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:05,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:06,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:06,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:06,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:06,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:06,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:06,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:06,409 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:06,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:06,430 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:06,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:06,431 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-28 10:38:06,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:06,439 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:06,440 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:06,448 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:06,448 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:06,802 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:06,803 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:06,808 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:06,809 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:06,828 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:06,828 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:07,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:07,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2019-02-28 10:38:07,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:07,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-28 10:38:07,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-28 10:38:07,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:38:07,540 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2019-02-28 10:38:08,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:08,159 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-02-28 10:38:08,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-28 10:38:08,160 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2019-02-28 10:38:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:08,161 INFO L225 Difference]: With dead ends: 32 [2019-02-28 10:38:08,161 INFO L226 Difference]: Without dead ends: 31 [2019-02-28 10:38:08,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:38:08,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-28 10:38:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-02-28 10:38:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-28 10:38:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-02-28 10:38:08,167 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-02-28 10:38:08,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:08,167 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-02-28 10:38:08,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-28 10:38:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-02-28 10:38:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-02-28 10:38:08,168 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:08,168 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-02-28 10:38:08,168 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:08,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:08,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-02-28 10:38:08,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:08,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:08,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:08,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:08,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:08,719 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:08,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:08,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:08,720 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:08,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:08,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:08,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:08,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:08,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:08,741 WARN L254 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-28 10:38:08,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:08,745 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:08,745 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:08,748 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:08,748 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:09,147 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:09,148 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:09,153 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:09,153 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:09,173 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:09,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:09,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2019-02-28 10:38:09,800 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:09,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-28 10:38:09,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-28 10:38:09,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-02-28 10:38:09,802 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2019-02-28 10:38:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:10,580 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-02-28 10:38:10,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-28 10:38:10,580 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2019-02-28 10:38:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:10,582 INFO L225 Difference]: With dead ends: 34 [2019-02-28 10:38:10,582 INFO L226 Difference]: Without dead ends: 33 [2019-02-28 10:38:10,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-02-28 10:38:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-28 10:38:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-02-28 10:38:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-28 10:38:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-28 10:38:10,588 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-02-28 10:38:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:10,589 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-28 10:38:10,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-28 10:38:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-28 10:38:10,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-28 10:38:10,590 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:10,590 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-02-28 10:38:10,590 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:10,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:10,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-02-28 10:38:10,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:10,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:10,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:10,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:10,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:11,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:11,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:11,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:11,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:11,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:11,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:11,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:11,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:11,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-28 10:38:11,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:11,564 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-28 10:38:11,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:11,570 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:11,571 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:11,581 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:11,581 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:11,979 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:11,980 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:11,989 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:11,990 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:12,013 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:13,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:13,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2019-02-28 10:38:13,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:13,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-28 10:38:13,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-28 10:38:13,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:38:13,158 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2019-02-28 10:38:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:13,853 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-28 10:38:13,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-28 10:38:13,854 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2019-02-28 10:38:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:13,855 INFO L225 Difference]: With dead ends: 36 [2019-02-28 10:38:13,855 INFO L226 Difference]: Without dead ends: 35 [2019-02-28 10:38:13,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:38:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-28 10:38:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-28 10:38:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-28 10:38:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-28 10:38:13,861 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-02-28 10:38:13,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:13,862 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-28 10:38:13,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-28 10:38:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-28 10:38:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-28 10:38:13,862 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:13,863 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-02-28 10:38:13,863 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-02-28 10:38:13,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:13,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:13,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:13,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:13,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:14,142 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:38:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:14,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:14,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:14,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:14,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:14,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:14,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:14,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:14,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:14,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:14,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:14,655 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-28 10:38:14,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:14,667 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:14,668 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:14,671 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:14,672 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:15,139 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:15,140 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:15,147 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:15,147 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:15,175 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:16,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:16,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2019-02-28 10:38:16,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:16,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-28 10:38:16,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-28 10:38:16,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-02-28 10:38:16,227 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2019-02-28 10:38:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:16,727 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-02-28 10:38:16,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-28 10:38:16,727 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2019-02-28 10:38:16,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:16,728 INFO L225 Difference]: With dead ends: 38 [2019-02-28 10:38:16,728 INFO L226 Difference]: Without dead ends: 37 [2019-02-28 10:38:16,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-02-28 10:38:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-28 10:38:16,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-02-28 10:38:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-28 10:38:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-28 10:38:16,735 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-02-28 10:38:16,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:16,735 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-28 10:38:16,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-28 10:38:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-28 10:38:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-28 10:38:16,736 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:16,737 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-02-28 10:38:16,737 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:16,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:16,737 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-02-28 10:38:16,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:16,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:16,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:16,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:16,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:17,006 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:38:17,257 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-28 10:38:17,517 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:38:17,806 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:38:18,114 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-28 10:38:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:18,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:18,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:18,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:18,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:18,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:18,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:18,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:18,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:18,768 WARN L254 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-28 10:38:18,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:18,774 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:18,774 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:18,780 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:18,781 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:19,358 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:19,359 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:19,364 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:19,364 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:19,393 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:20,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:20,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2019-02-28 10:38:20,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:20,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-28 10:38:20,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-28 10:38:20,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:38:20,340 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2019-02-28 10:38:21,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:21,264 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-28 10:38:21,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-28 10:38:21,264 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2019-02-28 10:38:21,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:21,265 INFO L225 Difference]: With dead ends: 40 [2019-02-28 10:38:21,265 INFO L226 Difference]: Without dead ends: 39 [2019-02-28 10:38:21,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:38:21,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-28 10:38:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-02-28 10:38:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-28 10:38:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-02-28 10:38:21,272 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-02-28 10:38:21,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:21,272 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-02-28 10:38:21,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-28 10:38:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-02-28 10:38:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-28 10:38:21,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:21,273 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-02-28 10:38:21,273 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:21,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:21,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-02-28 10:38:21,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:21,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:21,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:21,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:21,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:21,547 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:38:21,809 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:38:22,093 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:38:22,383 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:38:23,168 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2019-02-28 10:38:23,217 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:23,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:23,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:23,218 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:23,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:23,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:23,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:23,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:23,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:23,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-28 10:38:23,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:23,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 41 conjunts are in the unsatisfiable core [2019-02-28 10:38:23,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:23,261 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:23,261 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:23,266 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:23,267 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:24,023 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:24,024 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:24,029 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:24,029 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:24,054 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:25,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:25,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2019-02-28 10:38:25,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:25,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-28 10:38:25,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-28 10:38:25,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-02-28 10:38:25,047 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2019-02-28 10:38:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:25,903 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-28 10:38:25,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-28 10:38:25,903 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2019-02-28 10:38:25,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:25,904 INFO L225 Difference]: With dead ends: 42 [2019-02-28 10:38:25,904 INFO L226 Difference]: Without dead ends: 41 [2019-02-28 10:38:25,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-02-28 10:38:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-28 10:38:25,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-02-28 10:38:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-28 10:38:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-28 10:38:25,911 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-02-28 10:38:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:25,911 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-28 10:38:25,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-28 10:38:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-28 10:38:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-28 10:38:25,912 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:25,912 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-02-28 10:38:25,912 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:25,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-02-28 10:38:25,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:25,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:25,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:25,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:25,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:26,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:26,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:26,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:26,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:26,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:26,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:26,570 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:26,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:26,595 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:26,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:26,596 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-28 10:38:26,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:26,612 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:26,613 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:26,621 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:26,622 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:27,293 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:27,294 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:27,298 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:27,298 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:27,324 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:28,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:28,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2019-02-28 10:38:28,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:28,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-28 10:38:28,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-28 10:38:28,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:38:28,492 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2019-02-28 10:38:29,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:29,511 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-02-28 10:38:29,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-28 10:38:29,511 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2019-02-28 10:38:29,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:29,512 INFO L225 Difference]: With dead ends: 44 [2019-02-28 10:38:29,512 INFO L226 Difference]: Without dead ends: 43 [2019-02-28 10:38:29,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:38:29,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-28 10:38:29,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-02-28 10:38:29,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-28 10:38:29,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-28 10:38:29,518 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-02-28 10:38:29,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:29,519 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-28 10:38:29,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-28 10:38:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-28 10:38:29,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-28 10:38:29,520 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:29,520 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-02-28 10:38:29,520 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:29,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:29,520 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-02-28 10:38:29,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:29,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:29,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:29,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:29,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:29,711 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:38:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:30,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:30,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:30,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:30,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:30,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:30,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:30,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:30,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:30,519 WARN L254 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 45 conjunts are in the unsatisfiable core [2019-02-28 10:38:30,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:30,525 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:30,525 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:30,530 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:30,530 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:31,235 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:31,236 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:31,240 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:31,241 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:31,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:32,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:32,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2019-02-28 10:38:32,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:32,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-28 10:38:32,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-28 10:38:32,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-02-28 10:38:32,453 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2019-02-28 10:38:33,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:33,324 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-28 10:38:33,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-28 10:38:33,324 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2019-02-28 10:38:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:33,325 INFO L225 Difference]: With dead ends: 46 [2019-02-28 10:38:33,325 INFO L226 Difference]: Without dead ends: 45 [2019-02-28 10:38:33,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-02-28 10:38:33,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-28 10:38:33,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-02-28 10:38:33,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-28 10:38:33,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-02-28 10:38:33,334 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-02-28 10:38:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:33,334 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-02-28 10:38:33,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-28 10:38:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-02-28 10:38:33,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-28 10:38:33,335 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:33,335 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-02-28 10:38:33,335 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:33,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:33,336 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-02-28 10:38:33,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:33,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:33,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:33,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:33,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:34,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:34,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:34,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:34,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:34,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:34,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:34,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:34,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:34,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-28 10:38:34,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:34,248 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-28 10:38:34,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:34,268 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:34,269 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:34,278 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:34,278 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:35,262 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:35,263 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:35,270 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:35,270 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:35,299 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:36,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:36,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2019-02-28 10:38:36,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:36,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:38:36,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:38:36,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:38:36,540 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2019-02-28 10:38:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:37,423 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-28 10:38:37,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-28 10:38:37,424 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2019-02-28 10:38:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:37,424 INFO L225 Difference]: With dead ends: 48 [2019-02-28 10:38:37,424 INFO L226 Difference]: Without dead ends: 47 [2019-02-28 10:38:37,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:38:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-28 10:38:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-02-28 10:38:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-28 10:38:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-28 10:38:37,430 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-02-28 10:38:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:37,431 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-28 10:38:37,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:38:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-28 10:38:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-28 10:38:37,431 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:37,432 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-02-28 10:38:37,432 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:37,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:37,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-02-28 10:38:37,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:37,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:37,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:37,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:37,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:37,637 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:38:38,281 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:38,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:38,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:38,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:38,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:38,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:38,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:38,291 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:38,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:38,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:38,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:38,309 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-28 10:38:38,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:38,320 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:38,320 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:38,329 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:38,329 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:39,488 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:39,489 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:39,493 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:39,493 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:39,528 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:40,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:40,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2019-02-28 10:38:40,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:40,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-28 10:38:40,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-28 10:38:40,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-02-28 10:38:40,946 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2019-02-28 10:38:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:42,053 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-28 10:38:42,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-28 10:38:42,058 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2019-02-28 10:38:42,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:42,058 INFO L225 Difference]: With dead ends: 50 [2019-02-28 10:38:42,059 INFO L226 Difference]: Without dead ends: 49 [2019-02-28 10:38:42,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-02-28 10:38:42,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-28 10:38:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-02-28 10:38:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-28 10:38:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-02-28 10:38:42,063 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-02-28 10:38:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:42,063 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-02-28 10:38:42,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-28 10:38:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-02-28 10:38:42,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-28 10:38:42,064 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:42,064 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-02-28 10:38:42,064 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:42,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:42,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-02-28 10:38:42,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:42,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:42,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:42,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:42,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:42,224 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:38:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:42,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:42,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:42,942 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:42,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:42,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:42,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:42,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:42,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:42,966 WARN L254 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-28 10:38:42,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:42,972 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:42,973 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:42,982 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:42,983 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:44,141 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:44,142 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:44,147 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:44,147 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:44,181 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:45,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:45,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2019-02-28 10:38:45,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:45,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-28 10:38:45,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-28 10:38:45,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:38:45,666 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2019-02-28 10:38:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:46,811 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-02-28 10:38:46,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-28 10:38:46,811 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2019-02-28 10:38:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:46,813 INFO L225 Difference]: With dead ends: 52 [2019-02-28 10:38:46,813 INFO L226 Difference]: Without dead ends: 51 [2019-02-28 10:38:46,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:38:46,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-28 10:38:46,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-02-28 10:38:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-28 10:38:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-02-28 10:38:46,818 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-02-28 10:38:46,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:46,819 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-02-28 10:38:46,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-28 10:38:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-02-28 10:38:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-02-28 10:38:46,819 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:46,820 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-02-28 10:38:46,820 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:46,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:46,820 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-02-28 10:38:46,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:46,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:46,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:46,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:46,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:47,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:47,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:47,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:47,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:47,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:47,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:47,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:47,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:47,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-28 10:38:47,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:47,700 WARN L254 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 53 conjunts are in the unsatisfiable core [2019-02-28 10:38:47,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:47,707 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:47,708 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:47,713 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:47,714 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:48,647 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:48,648 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:48,652 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:48,652 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:48,686 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:50,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:50,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2019-02-28 10:38:50,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:50,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-28 10:38:50,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-28 10:38:50,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-02-28 10:38:50,458 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2019-02-28 10:38:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:51,914 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-28 10:38:51,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-28 10:38:51,915 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2019-02-28 10:38:51,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:51,915 INFO L225 Difference]: With dead ends: 54 [2019-02-28 10:38:51,916 INFO L226 Difference]: Without dead ends: 53 [2019-02-28 10:38:51,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-02-28 10:38:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-28 10:38:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-02-28 10:38:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-28 10:38:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-28 10:38:51,933 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-02-28 10:38:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:51,933 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-28 10:38:51,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-28 10:38:51,934 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-28 10:38:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-28 10:38:51,934 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:51,934 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-02-28 10:38:51,934 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:51,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:51,939 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-02-28 10:38:51,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:51,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:51,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:51,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:51,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:52,214 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:38:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:53,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:53,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:53,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:53,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:53,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:53,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:53,110 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:53,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:53,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:53,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:53,128 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-28 10:38:53,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:53,132 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:53,132 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:53,140 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:53,140 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:38:54,229 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:38:54,230 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:54,242 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:54,243 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:38:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:54,281 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:57,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:57,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2019-02-28 10:38:57,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:57,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-28 10:38:57,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-28 10:38:57,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:38:57,277 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2019-02-28 10:38:58,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:58,495 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-28 10:38:58,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-28 10:38:58,496 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2019-02-28 10:38:58,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:58,497 INFO L225 Difference]: With dead ends: 56 [2019-02-28 10:38:58,497 INFO L226 Difference]: Without dead ends: 55 [2019-02-28 10:38:58,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:38:58,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-28 10:38:58,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-02-28 10:38:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-28 10:38:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-02-28 10:38:58,501 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-02-28 10:38:58,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:58,501 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-02-28 10:38:58,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-28 10:38:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-02-28 10:38:58,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-02-28 10:38:58,502 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:58,502 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-02-28 10:38:58,503 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:58,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:58,503 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-02-28 10:38:58,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:58,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:58,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:58,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:58,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:58,713 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:38:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:59,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:59,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:59,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:59,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:59,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:59,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:59,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:59,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:59,843 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 57 conjunts are in the unsatisfiable core [2019-02-28 10:38:59,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:59,846 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:38:59,846 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:38:59,851 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:38:59,851 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:39:00,903 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:39:00,904 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:00,910 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:00,910 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:39:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:00,955 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:02,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:02,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2019-02-28 10:39:02,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:02,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-28 10:39:02,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-28 10:39:02,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-02-28 10:39:02,753 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2019-02-28 10:39:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:04,025 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-02-28 10:39:04,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-28 10:39:04,025 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2019-02-28 10:39:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:04,026 INFO L225 Difference]: With dead ends: 58 [2019-02-28 10:39:04,026 INFO L226 Difference]: Without dead ends: 57 [2019-02-28 10:39:04,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-02-28 10:39:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-28 10:39:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-02-28 10:39:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-28 10:39:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-28 10:39:04,030 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-02-28 10:39:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:04,031 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-28 10:39:04,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-28 10:39:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-28 10:39:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-28 10:39:04,032 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:04,032 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-02-28 10:39:04,032 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:04,032 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-02-28 10:39:04,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:04,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:04,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:04,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:04,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:05,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:05,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:05,186 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:05,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:05,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:05,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:05,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:05,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:05,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-28 10:39:05,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:05,243 WARN L254 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-28 10:39:05,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:05,248 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:39:05,249 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:05,255 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:05,255 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:39:06,401 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:39:06,402 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:06,407 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:06,408 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:39:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:06,445 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:08,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:08,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2019-02-28 10:39:08,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:08,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-28 10:39:08,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-28 10:39:08,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:39:08,377 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2019-02-28 10:39:10,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:10,421 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-28 10:39:10,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-28 10:39:10,421 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2019-02-28 10:39:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:10,422 INFO L225 Difference]: With dead ends: 60 [2019-02-28 10:39:10,422 INFO L226 Difference]: Without dead ends: 59 [2019-02-28 10:39:10,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:39:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-28 10:39:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-02-28 10:39:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-28 10:39:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-28 10:39:10,427 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-02-28 10:39:10,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:10,428 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-28 10:39:10,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-28 10:39:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-28 10:39:10,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-28 10:39:10,428 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:10,429 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-02-28 10:39:10,429 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:10,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-02-28 10:39:10,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:10,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:10,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:10,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:10,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:11,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:11,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:11,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:11,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:11,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:11,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:11,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:11,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:11,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:11,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:11,504 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-28 10:39:11,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:11,508 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:39:11,508 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:11,514 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:11,514 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:39:12,729 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:39:12,730 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:12,734 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:12,735 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:39:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:12,779 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:15,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:15,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2019-02-28 10:39:15,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:15,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-28 10:39:15,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-28 10:39:15,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-02-28 10:39:15,115 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2019-02-28 10:39:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:16,594 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-02-28 10:39:16,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-28 10:39:16,595 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2019-02-28 10:39:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:16,596 INFO L225 Difference]: With dead ends: 62 [2019-02-28 10:39:16,596 INFO L226 Difference]: Without dead ends: 61 [2019-02-28 10:39:16,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-02-28 10:39:16,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-28 10:39:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-02-28 10:39:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-28 10:39:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-02-28 10:39:16,601 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-02-28 10:39:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:16,601 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-02-28 10:39:16,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-28 10:39:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-02-28 10:39:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-28 10:39:16,602 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:16,602 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-02-28 10:39:16,602 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:16,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:16,602 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-02-28 10:39:16,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:16,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:16,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:16,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:16,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:16,846 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:39:17,068 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-28 10:39:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:18,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:18,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:18,104 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:18,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:18,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:18,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:18,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:18,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:18,135 WARN L254 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-28 10:39:18,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:18,138 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:39:18,138 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:18,146 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:18,146 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:39:19,423 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:39:19,424 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:19,434 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:19,435 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:39:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:19,510 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:21,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:21,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2019-02-28 10:39:21,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:21,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-28 10:39:21,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-28 10:39:21,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:39:21,908 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2019-02-28 10:39:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:23,404 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-02-28 10:39:23,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-28 10:39:23,405 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2019-02-28 10:39:23,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:23,406 INFO L225 Difference]: With dead ends: 64 [2019-02-28 10:39:23,406 INFO L226 Difference]: Without dead ends: 63 [2019-02-28 10:39:23,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:39:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-28 10:39:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-02-28 10:39:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-28 10:39:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-28 10:39:23,411 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-02-28 10:39:23,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:23,411 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-28 10:39:23,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-28 10:39:23,412 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-28 10:39:23,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-28 10:39:23,412 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:23,412 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-02-28 10:39:23,413 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:23,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:23,413 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-02-28 10:39:23,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:23,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:23,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:23,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:23,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:23,604 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:39:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:24,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:24,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:24,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:24,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:24,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:24,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:24,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:24,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:24,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-28 10:39:24,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:24,655 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 65 conjunts are in the unsatisfiable core [2019-02-28 10:39:24,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:24,659 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:39:24,659 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:24,674 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:24,674 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:39:26,181 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:39:26,182 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:26,185 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:26,185 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:39:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:26,229 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:28,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:28,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2019-02-28 10:39:28,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:28,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-28 10:39:28,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-28 10:39:28,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-02-28 10:39:28,552 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2019-02-28 10:39:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:30,591 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-28 10:39:30,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-28 10:39:30,592 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2019-02-28 10:39:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:30,593 INFO L225 Difference]: With dead ends: 66 [2019-02-28 10:39:30,593 INFO L226 Difference]: Without dead ends: 65 [2019-02-28 10:39:30,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-02-28 10:39:30,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-28 10:39:30,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-02-28 10:39:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-28 10:39:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-28 10:39:30,598 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-02-28 10:39:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:30,599 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-28 10:39:30,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-28 10:39:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-28 10:39:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-28 10:39:30,599 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:30,599 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-02-28 10:39:30,599 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:30,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-02-28 10:39:30,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:30,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:30,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:30,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:30,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:30,776 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:39:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:31,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:31,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:31,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:31,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:31,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:31,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:31,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:31,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:31,884 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:31,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:31,885 WARN L254 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-28 10:39:31,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:31,888 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:39:31,888 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:31,896 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:31,896 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:39:33,354 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:39:33,355 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:33,360 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:33,361 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:39:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:33,408 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:36,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:36,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2019-02-28 10:39:36,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:36,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-28 10:39:36,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-28 10:39:36,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:39:36,113 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2019-02-28 10:39:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:37,808 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-02-28 10:39:37,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-28 10:39:37,809 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2019-02-28 10:39:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:37,809 INFO L225 Difference]: With dead ends: 68 [2019-02-28 10:39:37,810 INFO L226 Difference]: Without dead ends: 67 [2019-02-28 10:39:37,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:39:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-28 10:39:37,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-02-28 10:39:37,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-28 10:39:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-28 10:39:37,815 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-02-28 10:39:37,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:37,815 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-28 10:39:37,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-28 10:39:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-28 10:39:37,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-28 10:39:37,815 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:37,816 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-02-28 10:39:37,816 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:37,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:37,816 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-02-28 10:39:37,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:37,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:37,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:37,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:37,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:39,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:39,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:39,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:39,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:39,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:39,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:39,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:39,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:39,085 WARN L254 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 69 conjunts are in the unsatisfiable core [2019-02-28 10:39:39,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:39,088 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:39:39,089 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:39,096 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:39,096 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:39:40,956 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:39:40,957 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:40,961 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:40,961 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:39:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:41,012 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:43,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:43,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2019-02-28 10:39:43,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:43,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-28 10:39:43,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-28 10:39:43,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-02-28 10:39:43,707 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2019-02-28 10:39:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:45,833 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-28 10:39:45,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-28 10:39:45,833 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2019-02-28 10:39:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:45,834 INFO L225 Difference]: With dead ends: 70 [2019-02-28 10:39:45,834 INFO L226 Difference]: Without dead ends: 69 [2019-02-28 10:39:45,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-02-28 10:39:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-28 10:39:45,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-02-28 10:39:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-28 10:39:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-02-28 10:39:45,840 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-02-28 10:39:45,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:45,840 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-02-28 10:39:45,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-28 10:39:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-02-28 10:39:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-28 10:39:45,841 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:45,841 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-02-28 10:39:45,841 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-02-28 10:39:45,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:45,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:45,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:47,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:47,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:47,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:47,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:47,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:47,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:47,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:47,163 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:47,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-28 10:39:47,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:47,206 WARN L254 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 71 conjunts are in the unsatisfiable core [2019-02-28 10:39:47,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:47,211 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:39:47,211 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:47,218 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:47,218 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:39:48,990 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:39:48,991 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:48,998 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:48,998 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:39:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:49,050 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:52,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:52,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2019-02-28 10:39:52,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:52,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-28 10:39:52,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-28 10:39:52,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:39:52,031 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2019-02-28 10:39:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:54,760 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-28 10:39:54,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-28 10:39:54,761 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2019-02-28 10:39:54,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:54,762 INFO L225 Difference]: With dead ends: 72 [2019-02-28 10:39:54,762 INFO L226 Difference]: Without dead ends: 71 [2019-02-28 10:39:54,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:39:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-28 10:39:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-02-28 10:39:54,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-28 10:39:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-28 10:39:54,767 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-02-28 10:39:54,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:54,767 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-28 10:39:54,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-28 10:39:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-28 10:39:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-28 10:39:54,768 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:54,768 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-02-28 10:39:54,768 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:54,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:54,769 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-02-28 10:39:54,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:54,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:54,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:54,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:54,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:54,970 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:39:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:56,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:56,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:56,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:56,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:56,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:56,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:56,424 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:56,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:56,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:56,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:56,447 WARN L254 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-28 10:39:56,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:56,450 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:39:56,450 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:56,458 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:56,458 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:39:58,233 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:39:58,233 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:39:58,239 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:39:58,239 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:39:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:58,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:01,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:01,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2019-02-28 10:40:01,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:01,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-28 10:40:01,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-28 10:40:01,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-02-28 10:40:01,498 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2019-02-28 10:40:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:03,884 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-02-28 10:40:03,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-28 10:40:03,885 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2019-02-28 10:40:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:03,886 INFO L225 Difference]: With dead ends: 74 [2019-02-28 10:40:03,886 INFO L226 Difference]: Without dead ends: 73 [2019-02-28 10:40:03,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-02-28 10:40:03,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-28 10:40:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-02-28 10:40:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-28 10:40:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-28 10:40:03,891 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-02-28 10:40:03,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:03,891 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-28 10:40:03,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-28 10:40:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-28 10:40:03,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-28 10:40:03,892 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:03,892 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-02-28 10:40:03,892 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:03,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:03,893 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-02-28 10:40:03,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:03,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:03,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:03,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:03,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:05,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:05,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:05,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:05,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:05,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:05,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:05,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:05,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:40:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:05,311 WARN L254 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-28 10:40:05,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:05,314 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:40:05,315 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:05,324 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:05,324 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:40:07,456 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:40:07,457 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:07,461 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:07,462 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:40:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:07,512 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:11,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:11,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2019-02-28 10:40:11,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:11,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-28 10:40:11,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-28 10:40:11,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:40:11,081 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2019-02-28 10:40:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:13,550 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-28 10:40:13,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-28 10:40:13,556 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2019-02-28 10:40:13,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:13,557 INFO L225 Difference]: With dead ends: 76 [2019-02-28 10:40:13,557 INFO L226 Difference]: Without dead ends: 75 [2019-02-28 10:40:13,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:40:13,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-28 10:40:13,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-02-28 10:40:13,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-28 10:40:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-02-28 10:40:13,561 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-02-28 10:40:13,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:13,561 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-02-28 10:40:13,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-28 10:40:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-02-28 10:40:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-02-28 10:40:13,562 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:13,562 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-02-28 10:40:13,562 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:13,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:13,563 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-02-28 10:40:13,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:13,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:13,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:13,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:13,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:13,836 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:40:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:15,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:15,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:15,227 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:15,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:15,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:15,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:15,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:40:15,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:40:15,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-28 10:40:15,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:15,356 WARN L254 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 77 conjunts are in the unsatisfiable core [2019-02-28 10:40:15,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:15,359 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:40:15,359 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:15,368 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:15,368 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:40:17,522 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:40:17,523 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:17,528 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:17,529 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:40:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:17,583 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:20,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:20,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:20,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2019-02-28 10:40:20,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:20,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-28 10:40:20,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-28 10:40:20,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-02-28 10:40:20,918 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2019-02-28 10:40:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:24,047 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-28 10:40:24,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-28 10:40:24,048 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2019-02-28 10:40:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:24,049 INFO L225 Difference]: With dead ends: 78 [2019-02-28 10:40:24,049 INFO L226 Difference]: Without dead ends: 77 [2019-02-28 10:40:24,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2960 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-02-28 10:40:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-28 10:40:24,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-02-28 10:40:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-28 10:40:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-28 10:40:24,053 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-02-28 10:40:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:24,054 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-28 10:40:24,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-28 10:40:24,054 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-28 10:40:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-28 10:40:24,054 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:24,054 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-02-28 10:40:24,054 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:24,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:24,055 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-02-28 10:40:24,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:24,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:24,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:24,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:24,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:25,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:25,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:25,659 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:25,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:25,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:25,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:25,667 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:40:25,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:40:25,690 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:40:25,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:25,692 WARN L254 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-28 10:40:25,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:25,695 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:40:25,695 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:25,703 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:25,703 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:40:27,929 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:40:27,929 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:27,935 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:27,935 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:40:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:27,991 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:31,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:31,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2019-02-28 10:40:31,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:31,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-28 10:40:31,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-28 10:40:31,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:40:31,711 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2019-02-28 10:40:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:34,638 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-28 10:40:34,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-28 10:40:34,639 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2019-02-28 10:40:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:34,640 INFO L225 Difference]: With dead ends: 80 [2019-02-28 10:40:34,640 INFO L226 Difference]: Without dead ends: 79 [2019-02-28 10:40:34,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:40:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-28 10:40:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-02-28 10:40:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-28 10:40:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-02-28 10:40:34,645 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-02-28 10:40:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:34,645 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-02-28 10:40:34,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-28 10:40:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-02-28 10:40:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-02-28 10:40:34,646 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:34,646 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-02-28 10:40:34,646 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:34,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:34,646 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-02-28 10:40:34,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:34,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:34,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:34,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:34,869 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:40:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:36,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:36,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:36,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:36,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:36,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:36,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:36,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:36,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:40:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:36,493 WARN L254 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 81 conjunts are in the unsatisfiable core [2019-02-28 10:40:36,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:36,518 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:40:36,518 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:36,538 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:36,539 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:40:38,678 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:40:38,678 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:38,684 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:38,685 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:40:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:38,744 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:42,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:42,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2019-02-28 10:40:42,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:42,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-28 10:40:42,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-28 10:40:42,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-02-28 10:40:42,553 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2019-02-28 10:40:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:45,296 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-02-28 10:40:45,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-28 10:40:45,297 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2019-02-28 10:40:45,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:45,298 INFO L225 Difference]: With dead ends: 82 [2019-02-28 10:40:45,298 INFO L226 Difference]: Without dead ends: 81 [2019-02-28 10:40:45,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-02-28 10:40:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-28 10:40:45,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-02-28 10:40:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-28 10:40:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-02-28 10:40:45,303 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-02-28 10:40:45,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:45,303 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-02-28 10:40:45,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-28 10:40:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-02-28 10:40:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-28 10:40:45,303 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:45,304 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-02-28 10:40:45,304 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:45,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-02-28 10:40:45,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:45,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:45,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:45,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:45,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:45,557 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:40:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:47,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:47,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:47,323 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:47,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:47,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:47,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:47,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:40:47,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:40:47,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-28 10:40:47,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:47,388 WARN L254 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-28 10:40:47,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:47,410 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:40:47,411 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:47,417 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:47,417 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:40:49,606 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:40:49,606 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:49,612 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:49,612 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:40:49,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:49,675 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:53,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:53,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:53,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2019-02-28 10:40:53,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:53,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-28 10:40:53,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-28 10:40:53,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:40:53,772 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2019-02-28 10:40:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:57,437 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-28 10:40:57,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-28 10:40:57,438 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2019-02-28 10:40:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:57,439 INFO L225 Difference]: With dead ends: 84 [2019-02-28 10:40:57,439 INFO L226 Difference]: Without dead ends: 83 [2019-02-28 10:40:57,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3440 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:40:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-28 10:40:57,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-02-28 10:40:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-28 10:40:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-28 10:40:57,443 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-02-28 10:40:57,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:57,444 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-28 10:40:57,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-28 10:40:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-28 10:40:57,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-28 10:40:57,444 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:57,444 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-02-28 10:40:57,445 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:57,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:57,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-02-28 10:40:57,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:57,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:57,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:57,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:57,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:57,692 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:40:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:59,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:59,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:59,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:59,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:59,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:59,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:59,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:40:59,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:40:59,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:40:59,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:59,444 WARN L254 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-28 10:40:59,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:59,447 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:40:59,447 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:40:59,454 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:40:59,454 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:41:01,781 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:41:01,781 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:01,785 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:01,785 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:41:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:01,850 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:06,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:06,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2019-02-28 10:41:06,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:06,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-28 10:41:06,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-28 10:41:06,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-02-28 10:41:06,105 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2019-02-28 10:41:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:09,061 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-28 10:41:09,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-28 10:41:09,061 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2019-02-28 10:41:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:09,062 INFO L225 Difference]: With dead ends: 86 [2019-02-28 10:41:09,062 INFO L226 Difference]: Without dead ends: 85 [2019-02-28 10:41:09,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-02-28 10:41:09,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-28 10:41:09,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-02-28 10:41:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-28 10:41:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-02-28 10:41:09,068 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-02-28 10:41:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:09,069 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-02-28 10:41:09,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-28 10:41:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-02-28 10:41:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-28 10:41:09,069 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:09,069 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-02-28 10:41:09,070 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:09,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:09,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-02-28 10:41:09,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:09,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:09,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:09,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:09,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:09,322 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:41:09,569 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:41:09,791 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:41:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:11,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:11,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:11,425 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:11,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:11,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:11,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:11,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:11,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:41:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:11,466 WARN L254 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 87 conjunts are in the unsatisfiable core [2019-02-28 10:41:11,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:11,469 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:41:11,469 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:11,475 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:11,475 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:41:14,203 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:41:14,203 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:14,207 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:14,207 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:41:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:14,273 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:18,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:18,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2019-02-28 10:41:18,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:18,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-28 10:41:18,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-28 10:41:18,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:41:18,882 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2019-02-28 10:41:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:23,057 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-02-28 10:41:23,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-28 10:41:23,058 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2019-02-28 10:41:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:23,059 INFO L225 Difference]: With dead ends: 88 [2019-02-28 10:41:23,059 INFO L226 Difference]: Without dead ends: 87 [2019-02-28 10:41:23,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:41:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-28 10:41:23,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-02-28 10:41:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-28 10:41:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-28 10:41:23,064 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-02-28 10:41:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:23,064 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-28 10:41:23,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-28 10:41:23,065 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-28 10:41:23,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-28 10:41:23,065 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:23,065 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-02-28 10:41:23,066 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:23,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:23,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-02-28 10:41:23,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:23,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:23,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:23,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:23,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:23,305 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:41:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:25,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:25,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:25,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:25,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:25,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:25,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:25,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:41:25,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:41:25,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-28 10:41:25,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:25,084 WARN L254 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 89 conjunts are in the unsatisfiable core [2019-02-28 10:41:25,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:25,086 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:41:25,087 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:25,095 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:25,095 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:41:27,898 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:41:27,898 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:27,904 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:27,904 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:41:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:27,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:32,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:32,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2019-02-28 10:41:32,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:32,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-28 10:41:32,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-28 10:41:32,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-02-28 10:41:32,423 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2019-02-28 10:41:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:37,081 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-28 10:41:37,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-28 10:41:37,082 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2019-02-28 10:41:37,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:37,083 INFO L225 Difference]: With dead ends: 90 [2019-02-28 10:41:37,083 INFO L226 Difference]: Without dead ends: 89 [2019-02-28 10:41:37,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3956 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-02-28 10:41:37,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-28 10:41:37,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-02-28 10:41:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-28 10:41:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-28 10:41:37,088 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-02-28 10:41:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:37,088 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-28 10:41:37,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-28 10:41:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-28 10:41:37,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-28 10:41:37,089 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:37,089 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-02-28 10:41:37,089 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:37,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:37,089 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-02-28 10:41:37,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:37,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:37,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:37,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:37,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:39,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:39,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:39,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:39,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:39,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:39,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:39,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:41:39,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:41:39,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:41:39,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:39,212 WARN L254 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-28 10:41:39,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:39,215 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:41:39,215 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:39,223 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:39,223 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:41:41,882 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:41:41,882 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:41,895 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:41,896 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:41:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:41,960 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:46,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:46,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2019-02-28 10:41:46,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:46,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-28 10:41:46,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-28 10:41:46,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:41:46,880 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2019-02-28 10:41:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:51,630 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-02-28 10:41:51,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-28 10:41:51,631 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2019-02-28 10:41:51,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:51,632 INFO L225 Difference]: With dead ends: 92 [2019-02-28 10:41:51,632 INFO L226 Difference]: Without dead ends: 91 [2019-02-28 10:41:51,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:41:51,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-28 10:41:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-02-28 10:41:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-28 10:41:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-02-28 10:41:51,638 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-02-28 10:41:51,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:51,638 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-02-28 10:41:51,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-28 10:41:51,638 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-02-28 10:41:51,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-02-28 10:41:51,639 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:51,639 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-02-28 10:41:51,639 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:51,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:51,639 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-02-28 10:41:51,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:51,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:51,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:51,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:51,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:51,839 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:41:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:53,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:53,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:53,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:53,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:53,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:53,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:53,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:53,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:41:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:53,990 WARN L254 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 93 conjunts are in the unsatisfiable core [2019-02-28 10:41:53,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:53,994 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:41:53,995 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:54,002 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:54,002 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:41:56,784 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:41:56,784 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:41:56,790 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:41:56,790 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:41:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:56,858 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:01,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:01,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2019-02-28 10:42:01,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:01,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-28 10:42:01,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-28 10:42:01,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-02-28 10:42:01,995 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2019-02-28 10:42:05,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:05,901 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-02-28 10:42:05,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-28 10:42:05,902 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2019-02-28 10:42:05,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:05,903 INFO L225 Difference]: With dead ends: 94 [2019-02-28 10:42:05,903 INFO L226 Difference]: Without dead ends: 93 [2019-02-28 10:42:05,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4320 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-02-28 10:42:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-28 10:42:05,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-02-28 10:42:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-28 10:42:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-28 10:42:05,909 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-02-28 10:42:05,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:05,909 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-28 10:42:05,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-28 10:42:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-28 10:42:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-28 10:42:05,909 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:05,909 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-02-28 10:42:05,910 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:05,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:05,910 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-02-28 10:42:05,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:05,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:05,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:05,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:05,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:06,168 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:42:06,669 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:42:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:08,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:08,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:08,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:08,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:08,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:08,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:08,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:08,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:08,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-28 10:42:08,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:08,591 WARN L254 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-28 10:42:08,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:08,596 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:42:08,596 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:08,602 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:08,602 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:42:11,639 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:42:11,640 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:11,645 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:11,645 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:42:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:11,718 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:16,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:16,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:16,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2019-02-28 10:42:16,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:16,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-28 10:42:16,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-28 10:42:16,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:42:16,852 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2019-02-28 10:42:21,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:21,155 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-28 10:42:21,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-28 10:42:21,156 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2019-02-28 10:42:21,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:21,157 INFO L225 Difference]: With dead ends: 96 [2019-02-28 10:42:21,157 INFO L226 Difference]: Without dead ends: 95 [2019-02-28 10:42:21,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:42:21,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-28 10:42:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-02-28 10:42:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-28 10:42:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-28 10:42:21,163 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-02-28 10:42:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:21,164 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-28 10:42:21,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-28 10:42:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-28 10:42:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-28 10:42:21,164 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:21,164 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-02-28 10:42:21,164 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:21,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-02-28 10:42:21,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:21,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:21,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:21,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:21,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:23,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:23,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:23,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:23,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:23,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:23,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:23,283 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:23,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:23,321 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:23,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:23,323 WARN L254 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-28 10:42:23,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:23,330 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:42:23,330 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:23,336 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:23,336 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:42:26,634 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:42:26,635 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:26,641 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:26,641 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:42:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:26,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:32,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:32,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2019-02-28 10:42:32,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:32,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-28 10:42:32,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-28 10:42:32,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-02-28 10:42:32,256 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2019-02-28 10:42:36,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:36,935 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-02-28 10:42:36,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-28 10:42:36,935 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2019-02-28 10:42:36,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:36,936 INFO L225 Difference]: With dead ends: 98 [2019-02-28 10:42:36,937 INFO L226 Difference]: Without dead ends: 97 [2019-02-28 10:42:36,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-02-28 10:42:36,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-28 10:42:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-02-28 10:42:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-28 10:42:36,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-28 10:42:36,942 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-02-28 10:42:36,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:36,942 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-28 10:42:36,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-28 10:42:36,942 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-28 10:42:36,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-28 10:42:36,942 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:36,942 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-02-28 10:42:36,943 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:36,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:36,943 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-02-28 10:42:36,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:36,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:36,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:36,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:36,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:37,176 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:42:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:39,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:39,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:39,232 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:39,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:39,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:39,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:39,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:39,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:39,272 WARN L254 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 99 conjunts are in the unsatisfiable core [2019-02-28 10:42:39,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:39,275 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:42:39,275 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:39,281 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:39,281 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:42:42,623 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:42:42,624 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:42,628 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:42,628 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:42:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:42,701 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:48,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:48,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2019-02-28 10:42:48,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:48,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-28 10:42:48,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-28 10:42:48,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:42:48,471 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2019-02-28 10:42:52,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:52,832 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-28 10:42:52,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-28 10:42:52,833 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2019-02-28 10:42:52,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:52,834 INFO L225 Difference]: With dead ends: 100 [2019-02-28 10:42:52,834 INFO L226 Difference]: Without dead ends: 99 [2019-02-28 10:42:52,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:42:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-28 10:42:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-02-28 10:42:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-28 10:42:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-02-28 10:42:52,840 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-02-28 10:42:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:52,841 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-02-28 10:42:52,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-28 10:42:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-02-28 10:42:52,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-28 10:42:52,841 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:52,842 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-02-28 10:42:52,842 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:52,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:52,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-02-28 10:42:52,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:52,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:52,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:52,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:52,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:53,041 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:42:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:55,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:55,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:55,415 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:55,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:55,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:55,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:55,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:55,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:55,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-28 10:42:55,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:55,499 WARN L254 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 101 conjunts are in the unsatisfiable core [2019-02-28 10:42:55,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:55,518 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:42:55,519 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:55,590 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:55,590 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:43:00,050 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:43:00,050 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:00,056 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:00,056 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:43:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:00,135 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:06,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:06,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2019-02-28 10:43:06,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:06,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-28 10:43:06,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-28 10:43:06,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-02-28 10:43:06,112 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2019-02-28 10:43:10,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:10,421 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-28 10:43:10,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-28 10:43:10,421 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2019-02-28 10:43:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:10,422 INFO L225 Difference]: With dead ends: 102 [2019-02-28 10:43:10,422 INFO L226 Difference]: Without dead ends: 101 [2019-02-28 10:43:10,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-02-28 10:43:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-28 10:43:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-02-28 10:43:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-28 10:43:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-28 10:43:10,429 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-02-28 10:43:10,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:10,429 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-28 10:43:10,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-28 10:43:10,429 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-28 10:43:10,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-28 10:43:10,430 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:10,430 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-02-28 10:43:10,430 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:10,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:10,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-02-28 10:43:10,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:10,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:10,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:10,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:10,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:12,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:12,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:12,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:12,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:12,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:12,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:12,783 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:12,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:12,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:12,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:12,813 WARN L254 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-28 10:43:12,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:12,818 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:43:12,818 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:12,827 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:12,827 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:43:16,501 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:43:16,502 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:16,506 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:16,506 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:43:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:16,586 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:22,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:22,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2019-02-28 10:43:22,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:22,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-28 10:43:22,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-28 10:43:22,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:43:22,697 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2019-02-28 10:43:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:27,256 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-02-28 10:43:27,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-28 10:43:27,257 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2019-02-28 10:43:27,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:27,258 INFO L225 Difference]: With dead ends: 104 [2019-02-28 10:43:27,258 INFO L226 Difference]: Without dead ends: 103 [2019-02-28 10:43:27,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:43:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-28 10:43:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-02-28 10:43:27,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-28 10:43:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-02-28 10:43:27,265 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-02-28 10:43:27,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:27,265 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-02-28 10:43:27,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-28 10:43:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-02-28 10:43:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-02-28 10:43:27,266 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:27,266 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-02-28 10:43:27,267 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:27,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-02-28 10:43:27,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:27,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:27,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:27,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:27,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:27,451 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:43:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:29,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:29,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:29,726 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:29,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:29,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:29,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:29,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:29,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:29,764 WARN L254 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 105 conjunts are in the unsatisfiable core [2019-02-28 10:43:29,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:29,784 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:43:29,785 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:29,804 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:29,804 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:43:33,590 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:43:33,591 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:33,596 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:33,597 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:43:33,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:33,681 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:40,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:40,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2019-02-28 10:43:40,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:40,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-28 10:43:40,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-28 10:43:40,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-02-28 10:43:40,123 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2019-02-28 10:43:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:45,031 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-02-28 10:43:45,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-28 10:43:45,032 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2019-02-28 10:43:45,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:45,033 INFO L225 Difference]: With dead ends: 106 [2019-02-28 10:43:45,033 INFO L226 Difference]: Without dead ends: 105 [2019-02-28 10:43:45,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-02-28 10:43:45,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-28 10:43:45,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-02-28 10:43:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-28 10:43:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-02-28 10:43:45,040 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-02-28 10:43:45,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:45,040 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-02-28 10:43:45,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-28 10:43:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-02-28 10:43:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-28 10:43:45,041 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:45,041 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-02-28 10:43:45,041 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:45,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:45,042 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-02-28 10:43:45,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:45,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:45,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:45,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:45,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:45,321 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:43:45,580 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:43:45,873 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:43:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:48,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:48,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:48,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:48,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:48,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:48,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:48,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:48,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:48,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-28 10:43:48,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:48,533 WARN L254 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 107 conjunts are in the unsatisfiable core [2019-02-28 10:43:48,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:48,553 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:43:48,554 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:48,562 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:48,563 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:43:52,478 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:43:52,478 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:52,484 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:52,484 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:43:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:52,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:59,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:59,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2019-02-28 10:43:59,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:59,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-28 10:43:59,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-28 10:43:59,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:43:59,300 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 107 states. [2019-02-28 10:44:05,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:05,158 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-28 10:44:05,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-28 10:44:05,158 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 103 [2019-02-28 10:44:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:05,162 INFO L225 Difference]: With dead ends: 108 [2019-02-28 10:44:05,162 INFO L226 Difference]: Without dead ends: 107 [2019-02-28 10:44:05,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:44:05,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-28 10:44:05,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-02-28 10:44:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-28 10:44:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-28 10:44:05,168 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-02-28 10:44:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:05,168 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-28 10:44:05,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-28 10:44:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-28 10:44:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-28 10:44:05,169 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:05,169 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-02-28 10:44:05,170 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:05,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:05,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-02-28 10:44:05,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:05,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:05,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:05,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:05,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:07,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:07,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:07,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:07,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:07,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:07,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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:07,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:07,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:07,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:07,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:07,959 WARN L254 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 109 conjunts are in the unsatisfiable core [2019-02-28 10:44:07,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:07,963 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:44:07,963 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:07,974 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:07,974 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:44:12,087 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:44:12,087 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:12,093 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:12,093 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:44:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:12,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:19,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:19,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2019-02-28 10:44:19,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:19,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-02-28 10:44:19,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-02-28 10:44:19,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-02-28 10:44:19,038 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 109 states. [2019-02-28 10:44:26,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:26,146 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-28 10:44:26,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-28 10:44:26,147 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 105 [2019-02-28 10:44:26,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:26,148 INFO L225 Difference]: With dead ends: 110 [2019-02-28 10:44:26,148 INFO L226 Difference]: Without dead ends: 109 [2019-02-28 10:44:26,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5936 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-02-28 10:44:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-28 10:44:26,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-02-28 10:44:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-28 10:44:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-02-28 10:44:26,155 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-02-28 10:44:26,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:26,155 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-02-28 10:44:26,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-02-28 10:44:26,155 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-02-28 10:44:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-28 10:44:26,156 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:26,156 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-02-28 10:44:26,156 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:26,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:26,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2019-02-28 10:44:26,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:26,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:26,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:26,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:26,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:26,435 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:44:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:29,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:29,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:29,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:29,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:29,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:29,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:29,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:29,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:29,379 WARN L254 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 111 conjunts are in the unsatisfiable core [2019-02-28 10:44:29,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:29,399 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:44:29,400 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:29,458 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:29,459 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:44:33,990 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:44:33,990 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:33,999 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:33,999 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:44:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:34,087 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:41,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:41,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2019-02-28 10:44:41,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:41,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-28 10:44:41,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-28 10:44:41,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:44:41,303 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 111 states. [2019-02-28 10:44:46,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:46,234 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-02-28 10:44:46,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-28 10:44:46,234 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 107 [2019-02-28 10:44:46,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:46,236 INFO L225 Difference]: With dead ends: 112 [2019-02-28 10:44:46,236 INFO L226 Difference]: Without dead ends: 111 [2019-02-28 10:44:46,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6156 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:44:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-28 10:44:46,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-02-28 10:44:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-02-28 10:44:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-02-28 10:44:46,242 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-02-28 10:44:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:46,243 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-02-28 10:44:46,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-28 10:44:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-02-28 10:44:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-02-28 10:44:46,243 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:46,244 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-02-28 10:44:46,244 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:46,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2019-02-28 10:44:46,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:46,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:46,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:46,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:46,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:46,536 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:44:46,813 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:44:47,088 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:44:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:49,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:49,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:49,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:49,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:49,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:49,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:49,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:49,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:49,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-28 10:44:49,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:49,913 WARN L254 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 113 conjunts are in the unsatisfiable core [2019-02-28 10:44:49,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:49,916 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:44:49,916 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:49,924 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:49,924 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:44:54,062 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:44:54,063 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:54,067 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:54,068 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:44:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:54,194 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:01,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:01,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2019-02-28 10:45:01,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:01,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-28 10:45:01,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-28 10:45:01,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-02-28 10:45:01,646 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 113 states. [2019-02-28 10:45:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:08,732 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-28 10:45:08,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-28 10:45:08,733 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 109 [2019-02-28 10:45:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:08,734 INFO L225 Difference]: With dead ends: 114 [2019-02-28 10:45:08,734 INFO L226 Difference]: Without dead ends: 113 [2019-02-28 10:45:08,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6380 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-02-28 10:45:08,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-28 10:45:08,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-02-28 10:45:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-28 10:45:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-28 10:45:08,742 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-02-28 10:45:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:08,743 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-28 10:45:08,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-28 10:45:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-28 10:45:08,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-28 10:45:08,743 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:08,744 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-02-28 10:45:08,744 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:08,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:08,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2019-02-28 10:45:08,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:08,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:08,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:08,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:08,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:09,037 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:45:09,299 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:45:09,575 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:45:09,879 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:45:10,225 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:45:10,538 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:45:13,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:13,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:13,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:13,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:13,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:13,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:13,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:13,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:45:13,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:45:13,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:45:13,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:13,448 WARN L254 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 115 conjunts are in the unsatisfiable core [2019-02-28 10:45:13,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:13,451 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:45:13,451 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:13,457 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:13,457 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:45:17,693 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:45:17,694 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:17,699 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:17,700 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:45:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:17,786 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:25,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:25,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 170 [2019-02-28 10:45:25,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:25,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-02-28 10:45:25,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-02-28 10:45:25,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:45:25,634 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 115 states. [2019-02-28 10:45:31,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:31,066 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-02-28 10:45:31,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-28 10:45:31,066 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 111 [2019-02-28 10:45:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:31,068 INFO L225 Difference]: With dead ends: 116 [2019-02-28 10:45:31,068 INFO L226 Difference]: Without dead ends: 115 [2019-02-28 10:45:31,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:45:31,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-28 10:45:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-02-28 10:45:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-28 10:45:31,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-02-28 10:45:31,075 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-02-28 10:45:31,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:31,076 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-02-28 10:45:31,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-02-28 10:45:31,076 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-02-28 10:45:31,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-02-28 10:45:31,076 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:31,077 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-02-28 10:45:31,077 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:31,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:31,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2019-02-28 10:45:31,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:31,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:31,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:31,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:31,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:34,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:34,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:34,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:34,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:34,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:34,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:34,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:34,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:45:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:34,295 WARN L254 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 117 conjunts are in the unsatisfiable core [2019-02-28 10:45:34,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:34,298 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:45:34,298 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:34,306 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:34,306 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:45:38,882 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:45:38,882 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:38,888 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:38,888 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:45:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:38,978 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:46,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:46,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 173 [2019-02-28 10:45:46,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:46,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-02-28 10:45:46,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-02-28 10:45:46,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-02-28 10:45:46,961 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 117 states. [2019-02-28 10:45:54,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:54,731 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-02-28 10:45:54,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-28 10:45:54,731 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 113 [2019-02-28 10:45:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:54,733 INFO L225 Difference]: With dead ends: 118 [2019-02-28 10:45:54,733 INFO L226 Difference]: Without dead ends: 117 [2019-02-28 10:45:54,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6840 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-02-28 10:45:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-28 10:45:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-02-28 10:45:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-28 10:45:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-02-28 10:45:54,739 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-02-28 10:45:54,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:54,739 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-02-28 10:45:54,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-02-28 10:45:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-02-28 10:45:54,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-02-28 10:45:54,740 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:54,740 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-02-28 10:45:54,740 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:54,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:54,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2019-02-28 10:45:54,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:54,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:54,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:54,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:54,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:55,035 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:45:55,307 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:45:55,585 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:45:55,886 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:45:56,226 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:45:56,601 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:45:56,978 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:45:57,385 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:45:57,811 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:45:58,249 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:46:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:01,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:01,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:01,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:01,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:01,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:01,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:01,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:46:01,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:46:01,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-28 10:46:01,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:01,540 WARN L254 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 119 conjunts are in the unsatisfiable core [2019-02-28 10:46:01,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:01,559 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:46:01,560 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:01,575 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:01,575 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:46:06,284 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:46:06,284 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:06,290 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:06,290 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:46:06,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:06,382 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:14,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:14,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 176 [2019-02-28 10:46:14,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:14,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-28 10:46:14,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-28 10:46:14,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:46:14,830 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 119 states. [2019-02-28 10:46:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:21,111 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-02-28 10:46:21,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-28 10:46:21,112 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 115 [2019-02-28 10:46:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:21,113 INFO L225 Difference]: With dead ends: 120 [2019-02-28 10:46:21,113 INFO L226 Difference]: Without dead ends: 119 [2019-02-28 10:46:21,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7076 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:46:21,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-28 10:46:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-02-28 10:46:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-02-28 10:46:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-02-28 10:46:21,117 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-02-28 10:46:21,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:21,117 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-02-28 10:46:21,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-28 10:46:21,118 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-02-28 10:46:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-02-28 10:46:21,118 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:21,118 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-02-28 10:46:21,118 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:21,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:21,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2019-02-28 10:46:21,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:21,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:21,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:21,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:21,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:21,408 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:46:21,675 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:46:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:24,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:24,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:24,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:24,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:24,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:24,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:24,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:46:24,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:46:24,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:46:24,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:24,846 WARN L254 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 121 conjunts are in the unsatisfiable core [2019-02-28 10:46:24,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:24,863 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:46:24,864 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:24,913 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:24,914 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:46:30,008 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:46:30,009 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:30,013 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:30,014 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:46:30,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:30,112 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:38,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:38,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 179 [2019-02-28 10:46:38,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:38,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-02-28 10:46:38,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-02-28 10:46:38,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-02-28 10:46:38,495 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 121 states. [2019-02-28 10:46:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:44,078 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-02-28 10:46:44,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-28 10:46:44,078 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 117 [2019-02-28 10:46:44,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:44,080 INFO L225 Difference]: With dead ends: 122 [2019-02-28 10:46:44,080 INFO L226 Difference]: Without dead ends: 121 [2019-02-28 10:46:44,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-02-28 10:46:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-28 10:46:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-02-28 10:46:44,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-02-28 10:46:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-02-28 10:46:44,085 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-02-28 10:46:44,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:44,085 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-02-28 10:46:44,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-02-28 10:46:44,085 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-02-28 10:46:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-02-28 10:46:44,086 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:44,086 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-02-28 10:46:44,086 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:44,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:44,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2019-02-28 10:46:44,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:44,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:44,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:44,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:44,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:44,284 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:46:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:47,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:47,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:47,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:47,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:47,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:47,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:47,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:47,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:46:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:47,456 WARN L254 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 123 conjunts are in the unsatisfiable core [2019-02-28 10:46:47,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:47,459 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:46:47,460 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:47,468 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:47,468 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:46:52,488 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:46:52,489 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:52,494 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:52,495 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:46:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:52,592 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:01,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:01,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 182 [2019-02-28 10:47:01,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:01,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-02-28 10:47:01,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-02-28 10:47:01,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:47:01,449 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 123 states. [2019-02-28 10:47:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:08,949 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-02-28 10:47:08,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-28 10:47:08,956 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 119 [2019-02-28 10:47:08,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:08,957 INFO L225 Difference]: With dead ends: 124 [2019-02-28 10:47:08,957 INFO L226 Difference]: Without dead ends: 123 [2019-02-28 10:47:08,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:47:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-28 10:47:08,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-02-28 10:47:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-28 10:47:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-02-28 10:47:08,963 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-02-28 10:47:08,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:08,963 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-02-28 10:47:08,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-02-28 10:47:08,963 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-02-28 10:47:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-02-28 10:47:08,964 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:08,964 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-02-28 10:47:08,964 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:08,964 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2019-02-28 10:47:08,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:08,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:08,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:08,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:08,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:12,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:12,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:12,369 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:12,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:12,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:12,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:12,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:47:12,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:47:12,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-28 10:47:12,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:12,488 WARN L254 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 125 conjunts are in the unsatisfiable core [2019-02-28 10:47:12,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:12,492 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:47:12,492 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:12,497 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:12,497 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:47:17,774 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:47:17,774 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:17,780 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:17,780 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:47:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:17,880 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:27,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:27,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 185 [2019-02-28 10:47:27,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:27,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-02-28 10:47:27,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-02-28 10:47:27,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-02-28 10:47:27,135 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 125 states. [2019-02-28 10:47:36,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:36,481 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-02-28 10:47:36,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-28 10:47:36,481 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 121 [2019-02-28 10:47:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:36,482 INFO L225 Difference]: With dead ends: 126 [2019-02-28 10:47:36,482 INFO L226 Difference]: Without dead ends: 125 [2019-02-28 10:47:36,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7808 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-02-28 10:47:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-28 10:47:36,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-02-28 10:47:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-02-28 10:47:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-02-28 10:47:36,489 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-02-28 10:47:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:36,489 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-02-28 10:47:36,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-02-28 10:47:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-02-28 10:47:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-02-28 10:47:36,489 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:36,490 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-02-28 10:47:36,490 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:36,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:36,490 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2019-02-28 10:47:36,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:36,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:36,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:36,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:36,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:39,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:39,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:39,871 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:39,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:39,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:39,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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:39,882 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:47:39,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:47:39,922 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:47:39,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:39,925 WARN L254 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 127 conjunts are in the unsatisfiable core [2019-02-28 10:47:39,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:39,930 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:47:39,930 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:39,940 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:39,940 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:47:45,332 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:47:45,333 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:45,337 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:45,338 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:47:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:45,440 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:54,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:54,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 188 [2019-02-28 10:47:54,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:54,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-02-28 10:47:54,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-02-28 10:47:54,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:47:54,915 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 127 states. [2019-02-28 10:48:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:04,387 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-02-28 10:48:04,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-28 10:48:04,387 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 123 [2019-02-28 10:48:04,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:04,388 INFO L225 Difference]: With dead ends: 128 [2019-02-28 10:48:04,389 INFO L226 Difference]: Without dead ends: 127 [2019-02-28 10:48:04,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:48:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-28 10:48:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-02-28 10:48:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-02-28 10:48:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-02-28 10:48:04,395 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-02-28 10:48:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:04,395 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-02-28 10:48:04,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-02-28 10:48:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-02-28 10:48:04,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-02-28 10:48:04,395 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:04,396 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-02-28 10:48:04,396 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:04,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:04,396 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2019-02-28 10:48:04,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:04,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:04,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:04,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:04,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:07,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:07,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:07,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:07,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:07,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:07,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:07,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:07,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:48:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:08,018 WARN L254 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 129 conjunts are in the unsatisfiable core [2019-02-28 10:48:08,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:08,022 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:48:08,022 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:08,031 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:08,031 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:48:13,472 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:48:13,472 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:13,478 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:13,478 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:48:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:13,581 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:23,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:23,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 191 [2019-02-28 10:48:23,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:23,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-02-28 10:48:23,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-02-28 10:48:23,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-02-28 10:48:23,352 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 129 states. [2019-02-28 10:48:31,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:31,498 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-02-28 10:48:31,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-28 10:48:31,498 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 125 [2019-02-28 10:48:31,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:31,499 INFO L225 Difference]: With dead ends: 130 [2019-02-28 10:48:31,500 INFO L226 Difference]: Without dead ends: 129 [2019-02-28 10:48:31,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8316 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-02-28 10:48:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-28 10:48:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-02-28 10:48:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-02-28 10:48:31,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-02-28 10:48:31,504 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-02-28 10:48:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:31,504 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-02-28 10:48:31,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-02-28 10:48:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-02-28 10:48:31,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-02-28 10:48:31,505 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:31,505 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-02-28 10:48:31,505 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:31,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:31,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2019-02-28 10:48:31,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:31,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:31,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:31,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:31,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:31,782 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:48:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:35,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:35,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:35,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:35,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:35,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:35,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:35,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:48:35,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:48:35,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-28 10:48:35,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:35,408 WARN L254 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 131 conjunts are in the unsatisfiable core [2019-02-28 10:48:35,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:35,410 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:48:35,411 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:35,416 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:35,416 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:48:41,099 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:48:41,099 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:41,105 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:41,105 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:48:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:41,213 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:51,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:51,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 194 [2019-02-28 10:48:51,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:51,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-28 10:48:51,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-28 10:48:51,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:48:51,127 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 131 states. [2019-02-28 10:48:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:57,685 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-02-28 10:48:57,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-28 10:48:57,686 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 127 [2019-02-28 10:48:57,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:57,687 INFO L225 Difference]: With dead ends: 132 [2019-02-28 10:48:57,687 INFO L226 Difference]: Without dead ends: 131 [2019-02-28 10:48:57,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8576 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:48:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-28 10:48:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-02-28 10:48:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-02-28 10:48:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-02-28 10:48:57,693 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-02-28 10:48:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:57,693 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-02-28 10:48:57,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-28 10:48:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-02-28 10:48:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-02-28 10:48:57,693 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:57,693 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-02-28 10:48:57,694 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:57,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2019-02-28 10:48:57,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:57,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:57,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:57,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:57,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:01,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:01,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:01,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:01,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:01,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:01,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:01,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:49:01,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:49:01,424 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:49:01,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:01,427 WARN L254 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 133 conjunts are in the unsatisfiable core [2019-02-28 10:49:01,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:01,434 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:49:01,434 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:01,442 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:01,442 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:49:07,276 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:49:07,277 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:07,282 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:07,282 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:49:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:07,391 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:17,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:17,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 197 [2019-02-28 10:49:17,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:17,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-02-28 10:49:17,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-02-28 10:49:17,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-02-28 10:49:17,909 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 133 states. [2019-02-28 10:49:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:26,271 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-02-28 10:49:26,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-28 10:49:26,272 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 129 [2019-02-28 10:49:26,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:26,273 INFO L225 Difference]: With dead ends: 134 [2019-02-28 10:49:26,273 INFO L226 Difference]: Without dead ends: 133 [2019-02-28 10:49:26,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8840 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-02-28 10:49:26,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-28 10:49:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-02-28 10:49:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-28 10:49:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-02-28 10:49:26,280 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-02-28 10:49:26,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:26,280 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-02-28 10:49:26,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-02-28 10:49:26,280 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-02-28 10:49:26,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-02-28 10:49:26,281 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:26,281 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-02-28 10:49:26,281 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:26,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:26,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2019-02-28 10:49:26,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:26,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:26,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:26,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:26,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:30,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:30,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:30,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:30,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:30,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:30,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:30,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:30,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:49:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:30,114 WARN L254 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 135 conjunts are in the unsatisfiable core [2019-02-28 10:49:30,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:30,117 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:49:30,117 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:30,125 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:30,125 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:49:36,210 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:49:36,211 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:36,222 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:36,222 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:49:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:36,332 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:47,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:47,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 200 [2019-02-28 10:49:47,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:47,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-02-28 10:49:47,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-02-28 10:49:47,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:49:47,014 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 135 states. [2019-02-28 10:49:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:57,546 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-02-28 10:49:57,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-28 10:49:57,546 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 131 [2019-02-28 10:49:57,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:57,547 INFO L225 Difference]: With dead ends: 136 [2019-02-28 10:49:57,548 INFO L226 Difference]: Without dead ends: 135 [2019-02-28 10:49:57,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:49:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-28 10:49:57,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-02-28 10:49:57,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-28 10:49:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-02-28 10:49:57,554 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-02-28 10:49:57,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:57,554 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-02-28 10:49:57,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-02-28 10:49:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-02-28 10:49:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-02-28 10:49:57,555 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:57,555 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-02-28 10:49:57,555 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:57,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:57,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2019-02-28 10:49:57,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:57,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:57,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:57,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:57,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:01,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:01,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:01,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:01,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:01,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:01,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:01,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:50:01,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:50:01,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-28 10:50:01,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:50:01,491 WARN L254 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 137 conjunts are in the unsatisfiable core [2019-02-28 10:50:01,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:01,511 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:50:01,512 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:01,556 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:01,556 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:50:09,136 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:50:09,136 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:09,141 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:09,141 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:50:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:09,273 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:20,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:20,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 203 [2019-02-28 10:50:20,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:20,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-02-28 10:50:20,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-02-28 10:50:20,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-02-28 10:50:20,509 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 137 states. [2019-02-28 10:50:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:27,878 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-02-28 10:50:27,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-28 10:50:27,878 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 133 [2019-02-28 10:50:27,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:27,880 INFO L225 Difference]: With dead ends: 138 [2019-02-28 10:50:27,880 INFO L226 Difference]: Without dead ends: 137 [2019-02-28 10:50:27,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9380 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-02-28 10:50:27,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-28 10:50:27,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-02-28 10:50:27,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-28 10:50:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-02-28 10:50:27,887 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-02-28 10:50:27,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:27,887 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-02-28 10:50:27,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-02-28 10:50:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-02-28 10:50:27,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-28 10:50:27,888 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:27,888 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-02-28 10:50:27,888 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:50:27,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:27,889 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2019-02-28 10:50:27,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:27,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:27,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:50:27,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:27,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:31,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:31,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:31,892 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:31,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:31,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:31,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:31,900 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:50:31,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:50:31,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:50:31,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:50:31,943 WARN L254 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 139 conjunts are in the unsatisfiable core [2019-02-28 10:50:31,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:31,963 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:50:31,964 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:31,993 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:31,993 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:50:38,483 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:50:38,484 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:38,490 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:38,490 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:50:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:38,604 INFO L322 TraceCheckSpWp]: Computing backward predicates...