java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:08:41,480 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:08:41,482 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:08:41,494 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:08:41,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:08:41,496 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:08:41,497 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:08:41,499 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:08:41,500 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:08:41,501 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:08:41,502 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:08:41,503 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:08:41,504 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:08:41,505 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:08:41,506 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:08:41,507 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:08:41,508 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:08:41,510 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:08:41,519 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:08:41,521 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:08:41,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:08:41,529 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:08:41,531 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:08:41,534 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:08:41,534 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:08:41,535 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:08:41,538 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:08:41,539 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:08:41,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:08:41,545 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:08:41,545 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:08:41,546 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:08:41,546 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:08:41,546 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:08:41,547 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:08:41,548 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:08:41,551 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-02 12:08:41,579 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:08:41,580 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:08:41,580 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:08:41,580 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:08:41,581 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:08:41,581 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:08:41,581 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:08:41,582 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:08:41,582 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:08:41,582 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:08:41,582 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:08:41,582 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:08:41,583 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:08:41,583 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:08:41,583 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:08:41,583 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:08:41,583 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:08:41,584 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:08:41,584 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:08:41,584 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:08:41,584 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:08:41,584 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:08:41,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:08:41,585 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:08:41,585 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:08:41,585 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:08:41,585 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:08:41,586 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:08:41,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:08:41,586 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:08:41,586 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:08:41,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:08:41,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:08:41,662 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:08:41,664 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:08:41,664 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:08:41,665 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2018-10-02 12:08:41,665 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2018-10-02 12:08:41,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:08:41,720 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:08:41,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:08:41,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:08:41,721 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:08:41,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:41" (1/1) ... [2018-10-02 12:08:41,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:41" (1/1) ... [2018-10-02 12:08:41,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:08:41,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:08:41,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:08:41,765 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:08:41,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:41" (1/1) ... [2018-10-02 12:08:41,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:41" (1/1) ... [2018-10-02 12:08:41,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:41" (1/1) ... [2018-10-02 12:08:41,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:41" (1/1) ... [2018-10-02 12:08:41,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:41" (1/1) ... [2018-10-02 12:08:41,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:41" (1/1) ... [2018-10-02 12:08:41,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:41" (1/1) ... [2018-10-02 12:08:41,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:08:41,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:08:41,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:08:41,787 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:08:41,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:08:41,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:08:41,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:08:42,132 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:08:42,133 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:08:42 BoogieIcfgContainer [2018-10-02 12:08:42,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:08:42,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:08:42,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:08:42,138 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:08:42,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:08:41" (1/2) ... [2018-10-02 12:08:42,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48fc95d0 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:08:42, skipping insertion in model container [2018-10-02 12:08:42,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:08:42" (2/2) ... [2018-10-02 12:08:42,142 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2018-10-02 12:08:42,152 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:08:42,160 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:08:42,214 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:08:42,215 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:08:42,215 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:08:42,215 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:08:42,215 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:08:42,215 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:08:42,216 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:08:42,216 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:08:42,216 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:08:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-10-02 12:08:42,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-02 12:08:42,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:42,240 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-02 12:08:42,242 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:42,248 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:42,249 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-10-02 12:08:42,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:42,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:42,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:42,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:42,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:08:42,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:08:42,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:08:42,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:08:42,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:08:42,433 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:42,435 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-10-02 12:08:42,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:42,692 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-10-02 12:08:42,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:08:42,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-10-02 12:08:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:42,706 INFO L225 Difference]: With dead ends: 17 [2018-10-02 12:08:42,706 INFO L226 Difference]: Without dead ends: 11 [2018-10-02 12:08:42,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:08:42,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-02 12:08:42,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-02 12:08:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-02 12:08:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-10-02 12:08:42,742 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2018-10-02 12:08:42,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:42,743 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-10-02 12:08:42,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:08:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-10-02 12:08:42,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:08:42,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:42,744 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 12:08:42,744 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:42,744 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:42,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-10-02 12:08:42,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:42,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:42,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:42,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:42,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 12:08:42,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:42,806 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:42,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:42,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 12:08:42,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:42,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-02 12:08:42,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:08:42,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:08:42,903 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:42,904 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2018-10-02 12:08:43,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:43,136 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-10-02 12:08:43,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 12:08:43,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-10-02 12:08:43,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:43,138 INFO L225 Difference]: With dead ends: 21 [2018-10-02 12:08:43,138 INFO L226 Difference]: Without dead ends: 15 [2018-10-02 12:08:43,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:08:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-02 12:08:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-02 12:08:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-02 12:08:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-10-02 12:08:43,144 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-10-02 12:08:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:43,144 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-10-02 12:08:43,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:08:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-10-02 12:08:43,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:08:43,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:43,146 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-10-02 12:08:43,146 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:43,146 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:43,146 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 2 times [2018-10-02 12:08:43,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:43,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:43,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:43,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:43,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-02 12:08:43,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:43,389 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:43,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:08:43,442 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:08:43,442 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:43,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-02 12:08:43,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:43,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-02 12:08:43,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:08:43,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:08:43,540 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:43,540 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2018-10-02 12:08:43,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:43,709 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-10-02 12:08:43,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:08:43,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-02 12:08:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:43,711 INFO L225 Difference]: With dead ends: 27 [2018-10-02 12:08:43,711 INFO L226 Difference]: Without dead ends: 19 [2018-10-02 12:08:43,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:08:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-02 12:08:43,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-02 12:08:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-02 12:08:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-10-02 12:08:43,718 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-10-02 12:08:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:43,718 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-10-02 12:08:43,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:08:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-10-02 12:08:43,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:08:43,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:43,719 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-10-02 12:08:43,720 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:43,721 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:43,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 3 times [2018-10-02 12:08:43,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:43,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:43,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:43,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:43,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-02 12:08:43,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:43,910 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:43,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:08:43,946 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-02 12:08:43,946 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:43,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-02 12:08:44,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:44,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-02 12:08:44,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 12:08:44,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 12:08:44,019 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:44,020 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-10-02 12:08:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:44,215 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-10-02 12:08:44,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 12:08:44,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-10-02 12:08:44,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:44,217 INFO L225 Difference]: With dead ends: 33 [2018-10-02 12:08:44,217 INFO L226 Difference]: Without dead ends: 23 [2018-10-02 12:08:44,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:08:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-02 12:08:44,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-02 12:08:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-02 12:08:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-10-02 12:08:44,226 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-10-02 12:08:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:44,226 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-10-02 12:08:44,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 12:08:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-10-02 12:08:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 12:08:44,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:44,227 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-10-02 12:08:44,228 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:44,228 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:44,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 4 times [2018-10-02 12:08:44,228 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:44,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:44,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:44,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:44,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-02 12:08:44,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:44,381 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:44,389 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:08:44,424 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:08:44,425 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:44,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-02 12:08:44,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:44,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 12:08:44,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:08:44,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:08:44,815 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:44,815 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2018-10-02 12:08:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:45,011 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-10-02 12:08:45,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 12:08:45,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-10-02 12:08:45,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:45,015 INFO L225 Difference]: With dead ends: 39 [2018-10-02 12:08:45,015 INFO L226 Difference]: Without dead ends: 27 [2018-10-02 12:08:45,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.0s impTime [2018-10-02 12:08:45,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-02 12:08:45,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-02 12:08:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-02 12:08:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-10-02 12:08:45,021 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2018-10-02 12:08:45,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:45,022 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-10-02 12:08:45,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:08:45,022 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-10-02 12:08:45,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 12:08:45,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:45,023 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-10-02 12:08:45,023 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:45,024 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:45,024 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 5 times [2018-10-02 12:08:45,024 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:45,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:45,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:45,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:45,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-02 12:08:45,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:45,150 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:45,163 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:08:45,208 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-02 12:08:45,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:45,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-02 12:08:45,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:45,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 12:08:45,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:08:45,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:08:45,315 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:45,315 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2018-10-02 12:08:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:45,518 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-10-02 12:08:45,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 12:08:45,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-02 12:08:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:45,520 INFO L225 Difference]: With dead ends: 45 [2018-10-02 12:08:45,521 INFO L226 Difference]: Without dead ends: 31 [2018-10-02 12:08:45,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:08:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-02 12:08:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-02 12:08:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-02 12:08:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-10-02 12:08:45,528 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2018-10-02 12:08:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:45,528 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-10-02 12:08:45,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:08:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-10-02 12:08:45,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 12:08:45,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:45,530 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-10-02 12:08:45,530 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:45,530 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:45,530 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 6 times [2018-10-02 12:08:45,531 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:45,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:45,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:45,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:45,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-02 12:08:45,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:45,665 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:45,680 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:08:45,722 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-02 12:08:45,723 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:45,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-02 12:08:45,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:45,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-02 12:08:45,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:08:45,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:08:45,829 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:45,829 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 9 states. [2018-10-02 12:08:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:46,008 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-10-02 12:08:46,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 12:08:46,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-10-02 12:08:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:46,010 INFO L225 Difference]: With dead ends: 51 [2018-10-02 12:08:46,011 INFO L226 Difference]: Without dead ends: 35 [2018-10-02 12:08:46,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:08:46,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-02 12:08:46,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-02 12:08:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-02 12:08:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-10-02 12:08:46,017 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-10-02 12:08:46,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:46,018 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-10-02 12:08:46,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:08:46,018 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-10-02 12:08:46,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:08:46,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:46,019 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-10-02 12:08:46,019 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:46,020 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:46,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 7 times [2018-10-02 12:08:46,020 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:46,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:46,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:46,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:46,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-02 12:08:46,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:46,148 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2018-10-02 12:08:46,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:46,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-02 12:08:46,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:46,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-02 12:08:46,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 12:08:46,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 12:08:46,494 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:46,495 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 10 states. [2018-10-02 12:08:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:46,680 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-10-02 12:08:46,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 12:08:46,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-10-02 12:08:46,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:46,682 INFO L225 Difference]: With dead ends: 57 [2018-10-02 12:08:46,682 INFO L226 Difference]: Without dead ends: 39 [2018-10-02 12:08:46,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime [2018-10-02 12:08:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-02 12:08:46,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-02 12:08:46,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-02 12:08:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-10-02 12:08:46,689 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-10-02 12:08:46,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:46,690 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-10-02 12:08:46,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 12:08:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-10-02 12:08:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-02 12:08:46,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:46,691 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-10-02 12:08:46,691 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:46,691 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:46,692 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 8 times [2018-10-02 12:08:46,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:46,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:46,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:46,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:46,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-02 12:08:46,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:46,829 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:46,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:08:46,870 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:08:46,870 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:46,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-02 12:08:46,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:46,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-02 12:08:46,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 12:08:46,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 12:08:46,969 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:46,969 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2018-10-02 12:08:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:47,270 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-10-02 12:08:47,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 12:08:47,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-10-02 12:08:47,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:47,277 INFO L225 Difference]: With dead ends: 63 [2018-10-02 12:08:47,277 INFO L226 Difference]: Without dead ends: 43 [2018-10-02 12:08:47,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:08:47,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-02 12:08:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-02 12:08:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-02 12:08:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-10-02 12:08:47,283 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2018-10-02 12:08:47,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:47,284 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-10-02 12:08:47,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 12:08:47,284 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-10-02 12:08:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-02 12:08:47,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:47,285 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-10-02 12:08:47,285 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:47,286 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:47,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 9 times [2018-10-02 12:08:47,286 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:47,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:47,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:47,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:47,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-02 12:08:47,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:47,499 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:47,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:08:47,662 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-02 12:08:47,662 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:47,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-02 12:08:47,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:47,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-02 12:08:47,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 12:08:47,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 12:08:47,885 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:47,885 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 12 states. [2018-10-02 12:08:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:48,067 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-10-02 12:08:48,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 12:08:48,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-10-02 12:08:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:48,070 INFO L225 Difference]: With dead ends: 69 [2018-10-02 12:08:48,070 INFO L226 Difference]: Without dead ends: 47 [2018-10-02 12:08:48,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:08:48,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-02 12:08:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-02 12:08:48,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-02 12:08:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-10-02 12:08:48,078 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2018-10-02 12:08:48,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:48,078 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-10-02 12:08:48,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 12:08:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-10-02 12:08:48,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-02 12:08:48,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:48,080 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-10-02 12:08:48,080 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:48,080 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:48,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 10 times [2018-10-02 12:08:48,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:48,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:48,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:48,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:48,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-02 12:08:48,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:48,241 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:48,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:08:48,281 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:08:48,281 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:48,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-02 12:08:48,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:48,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-02 12:08:48,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:08:48,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:08:48,387 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:48,387 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 13 states. [2018-10-02 12:08:48,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:48,664 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-10-02 12:08:48,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 12:08:48,665 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-10-02 12:08:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:48,666 INFO L225 Difference]: With dead ends: 75 [2018-10-02 12:08:48,666 INFO L226 Difference]: Without dead ends: 51 [2018-10-02 12:08:48,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:08:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-02 12:08:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-02 12:08:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-02 12:08:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-10-02 12:08:48,673 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2018-10-02 12:08:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:48,673 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-10-02 12:08:48,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:08:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-10-02 12:08:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-02 12:08:48,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:48,674 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-10-02 12:08:48,675 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:48,675 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:48,675 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 11 times [2018-10-02 12:08:48,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:48,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:48,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:48,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:48,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-02 12:08:49,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:49,120 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:49,131 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:08:49,173 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-02 12:08:49,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:49,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-02 12:08:49,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:49,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-02 12:08:49,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:08:49,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:08:49,297 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:49,297 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 14 states. [2018-10-02 12:08:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:49,652 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-10-02 12:08:49,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 12:08:49,652 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-10-02 12:08:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:49,653 INFO L225 Difference]: With dead ends: 81 [2018-10-02 12:08:49,654 INFO L226 Difference]: Without dead ends: 55 [2018-10-02 12:08:49,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:08:49,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-02 12:08:49,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-02 12:08:49,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-02 12:08:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-10-02 12:08:49,662 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2018-10-02 12:08:49,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:49,662 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-10-02 12:08:49,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:08:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-10-02 12:08:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-02 12:08:49,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:49,664 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-10-02 12:08:49,664 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:49,664 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 12 times [2018-10-02 12:08:49,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:49,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:49,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:49,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:49,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-02 12:08:49,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:49,886 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:49,894 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:08:49,951 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-02 12:08:49,951 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:49,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-02 12:08:50,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:50,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-02 12:08:50,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:08:50,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:08:50,105 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:50,106 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 15 states. [2018-10-02 12:08:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:50,477 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-10-02 12:08:50,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 12:08:50,477 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-10-02 12:08:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:50,478 INFO L225 Difference]: With dead ends: 87 [2018-10-02 12:08:50,478 INFO L226 Difference]: Without dead ends: 59 [2018-10-02 12:08:50,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime [2018-10-02 12:08:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-02 12:08:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-02 12:08:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-02 12:08:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-10-02 12:08:50,485 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-10-02 12:08:50,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:50,485 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-10-02 12:08:50,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:08:50,485 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-10-02 12:08:50,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-02 12:08:50,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:50,486 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-10-02 12:08:50,486 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:50,487 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:50,487 INFO L82 PathProgramCache]: Analyzing trace with hash 361552815, now seen corresponding path program 13 times [2018-10-02 12:08:50,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:50,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:50,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:50,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:50,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-10-02 12:08:50,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:50,649 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:50,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:50,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-10-02 12:08:50,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:50,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-02 12:08:50,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:08:50,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:08:50,905 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:50,906 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 16 states. [2018-10-02 12:08:51,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:51,297 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-10-02 12:08:51,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 12:08:51,298 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-10-02 12:08:51,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:51,299 INFO L225 Difference]: With dead ends: 93 [2018-10-02 12:08:51,299 INFO L226 Difference]: Without dead ends: 63 [2018-10-02 12:08:51,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime [2018-10-02 12:08:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-02 12:08:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-02 12:08:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-02 12:08:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-10-02 12:08:51,306 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2018-10-02 12:08:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:51,306 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-10-02 12:08:51,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:08:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-10-02 12:08:51,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-02 12:08:51,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:51,307 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-10-02 12:08:51,308 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:51,308 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:51,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1008142301, now seen corresponding path program 14 times [2018-10-02 12:08:51,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:51,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:51,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:51,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:51,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-02 12:08:51,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:51,606 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:51,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:08:51,650 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:08:51,650 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:51,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-02 12:08:51,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:51,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-02 12:08:51,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 12:08:51,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 12:08:51,802 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:51,802 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 17 states. [2018-10-02 12:08:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:52,022 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-10-02 12:08:52,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 12:08:52,022 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2018-10-02 12:08:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:52,024 INFO L225 Difference]: With dead ends: 99 [2018-10-02 12:08:52,024 INFO L226 Difference]: Without dead ends: 67 [2018-10-02 12:08:52,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:08:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-02 12:08:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-02 12:08:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-02 12:08:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-10-02 12:08:52,030 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2018-10-02 12:08:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:52,031 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-10-02 12:08:52,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 12:08:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-10-02 12:08:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-02 12:08:52,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:52,032 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-10-02 12:08:52,033 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:52,033 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:52,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1978312041, now seen corresponding path program 15 times [2018-10-02 12:08:52,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:52,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:52,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:52,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:52,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-02 12:08:52,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:52,261 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:52,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:08:52,318 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-02 12:08:52,318 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:52,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:52,416 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-02 12:08:52,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:52,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-02 12:08:52,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 12:08:52,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 12:08:52,438 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:52,438 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 18 states. [2018-10-02 12:08:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:52,957 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-10-02 12:08:52,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 12:08:52,957 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-10-02 12:08:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:52,959 INFO L225 Difference]: With dead ends: 105 [2018-10-02 12:08:52,959 INFO L226 Difference]: Without dead ends: 71 [2018-10-02 12:08:52,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:08:52,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-02 12:08:52,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-02 12:08:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-02 12:08:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-10-02 12:08:52,965 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2018-10-02 12:08:52,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:52,966 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-10-02 12:08:52,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 12:08:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-10-02 12:08:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-02 12:08:52,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:52,967 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-10-02 12:08:52,967 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:52,967 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:52,968 INFO L82 PathProgramCache]: Analyzing trace with hash 303497995, now seen corresponding path program 16 times [2018-10-02 12:08:52,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:52,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:52,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:52,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:52,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-02 12:08:53,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:53,408 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:53,416 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:08:53,447 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:08:53,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:53,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-02 12:08:53,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:53,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-02 12:08:53,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 12:08:53,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 12:08:53,575 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:53,576 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 19 states. [2018-10-02 12:08:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:53,834 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2018-10-02 12:08:53,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-02 12:08:53,835 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-10-02 12:08:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:53,836 INFO L225 Difference]: With dead ends: 111 [2018-10-02 12:08:53,836 INFO L226 Difference]: Without dead ends: 75 [2018-10-02 12:08:53,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:08:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-02 12:08:53,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-02 12:08:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-02 12:08:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-10-02 12:08:53,844 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2018-10-02 12:08:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:53,844 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-10-02 12:08:53,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-02 12:08:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-10-02 12:08:53,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-02 12:08:53,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:53,845 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-10-02 12:08:53,846 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:53,846 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:53,846 INFO L82 PathProgramCache]: Analyzing trace with hash -177016449, now seen corresponding path program 17 times [2018-10-02 12:08:53,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:53,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:53,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:53,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:53,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-10-02 12:08:54,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:54,901 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:54,909 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:08:54,984 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-02 12:08:54,984 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:54,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-10-02 12:08:55,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:55,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-02 12:08:55,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 12:08:55,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 12:08:55,299 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:55,299 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 20 states. [2018-10-02 12:08:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:56,149 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2018-10-02 12:08:56,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 12:08:56,150 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-10-02 12:08:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:56,151 INFO L225 Difference]: With dead ends: 117 [2018-10-02 12:08:56,151 INFO L226 Difference]: Without dead ends: 79 [2018-10-02 12:08:56,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.7s impTime [2018-10-02 12:08:56,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-02 12:08:56,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-02 12:08:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-02 12:08:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-10-02 12:08:56,158 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2018-10-02 12:08:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:56,159 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-10-02 12:08:56,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 12:08:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-10-02 12:08:56,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-02 12:08:56,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:56,160 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-10-02 12:08:56,160 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:56,160 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:56,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2100176371, now seen corresponding path program 18 times [2018-10-02 12:08:56,161 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:56,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:56,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:56,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:56,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-02 12:08:56,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:56,587 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:56,595 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:08:56,751 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-02 12:08:56,752 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:56,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-02 12:08:56,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:56,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-02 12:08:56,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-02 12:08:56,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-02 12:08:56,875 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:56,875 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 21 states. [2018-10-02 12:08:57,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:57,162 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2018-10-02 12:08:57,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 12:08:57,163 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-10-02 12:08:57,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:57,164 INFO L225 Difference]: With dead ends: 123 [2018-10-02 12:08:57,164 INFO L226 Difference]: Without dead ends: 83 [2018-10-02 12:08:57,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:08:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-02 12:08:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-02 12:08:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-02 12:08:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-10-02 12:08:57,170 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 78 [2018-10-02 12:08:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:57,171 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-10-02 12:08:57,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-02 12:08:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-10-02 12:08:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-02 12:08:57,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:57,172 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-10-02 12:08:57,172 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:57,172 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:57,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1640865895, now seen corresponding path program 19 times [2018-10-02 12:08:57,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:57,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:57,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:57,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:57,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-02 12:08:57,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:57,517 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:57,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:57,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:57,703 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-02 12:08:57,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:57,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-02 12:08:57,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-02 12:08:57,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-02 12:08:57,726 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:57,726 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 22 states. [2018-10-02 12:08:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:58,020 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-10-02 12:08:58,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-02 12:08:58,021 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 82 [2018-10-02 12:08:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:58,022 INFO L225 Difference]: With dead ends: 129 [2018-10-02 12:08:58,022 INFO L226 Difference]: Without dead ends: 87 [2018-10-02 12:08:58,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:08:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-02 12:08:58,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-02 12:08:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-02 12:08:58,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-10-02 12:08:58,027 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2018-10-02 12:08:58,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:58,028 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-10-02 12:08:58,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-02 12:08:58,028 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-10-02 12:08:58,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-02 12:08:58,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:58,029 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-10-02 12:08:58,029 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:58,029 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:58,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1957273381, now seen corresponding path program 20 times [2018-10-02 12:08:58,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:58,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:58,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:58,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:08:58,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:58,350 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-10-02 12:08:58,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:58,351 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:58,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:08:58,395 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:08:58,396 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:58,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-10-02 12:08:58,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:58,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-02 12:08:58,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-02 12:08:58,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-02 12:08:58,502 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:58,502 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 23 states. [2018-10-02 12:08:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:58,817 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2018-10-02 12:08:58,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 12:08:58,818 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2018-10-02 12:08:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:58,819 INFO L225 Difference]: With dead ends: 135 [2018-10-02 12:08:58,819 INFO L226 Difference]: Without dead ends: 91 [2018-10-02 12:08:58,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:08:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-02 12:08:58,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-02 12:08:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-02 12:08:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-02 12:08:58,824 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2018-10-02 12:08:58,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:58,824 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-02 12:08:58,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-02 12:08:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-02 12:08:58,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-02 12:08:58,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:58,825 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-10-02 12:08:58,826 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:58,826 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:58,826 INFO L82 PathProgramCache]: Analyzing trace with hash -783456433, now seen corresponding path program 21 times [2018-10-02 12:08:58,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:58,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:58,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:58,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:58,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:08:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-10-02 12:08:59,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:08:59,144 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:08:59,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:08:59,251 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-02 12:08:59,252 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:08:59,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:08:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-10-02 12:08:59,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:08:59,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-02 12:08:59,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-02 12:08:59,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-02 12:08:59,424 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:08:59,424 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 24 states. [2018-10-02 12:08:59,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:08:59,899 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-10-02 12:08:59,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 12:08:59,902 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2018-10-02 12:08:59,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:08:59,903 INFO L225 Difference]: With dead ends: 141 [2018-10-02 12:08:59,903 INFO L226 Difference]: Without dead ends: 95 [2018-10-02 12:08:59,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime [2018-10-02 12:08:59,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-02 12:08:59,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-10-02 12:08:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-02 12:08:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-10-02 12:08:59,907 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 90 [2018-10-02 12:08:59,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:08:59,907 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-10-02 12:08:59,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-02 12:08:59,907 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-10-02 12:08:59,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-02 12:08:59,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:08:59,908 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-10-02 12:08:59,909 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:08:59,909 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:08:59,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1162366013, now seen corresponding path program 22 times [2018-10-02 12:08:59,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:08:59,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:08:59,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:59,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:08:59,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:08:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-10-02 12:09:00,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:00,521 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:00,529 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:09:00,575 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:09:00,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:00,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-10-02 12:09:00,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:00,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-02 12:09:00,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-02 12:09:00,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-02 12:09:00,753 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:00,753 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 25 states. [2018-10-02 12:09:01,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:01,090 INFO L93 Difference]: Finished difference Result 147 states and 150 transitions. [2018-10-02 12:09:01,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 12:09:01,091 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-10-02 12:09:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:01,093 INFO L225 Difference]: With dead ends: 147 [2018-10-02 12:09:01,093 INFO L226 Difference]: Without dead ends: 99 [2018-10-02 12:09:01,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime [2018-10-02 12:09:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-02 12:09:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-10-02 12:09:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-02 12:09:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-10-02 12:09:01,097 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2018-10-02 12:09:01,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:01,097 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-10-02 12:09:01,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-02 12:09:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-10-02 12:09:01,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-02 12:09:01,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:01,098 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-10-02 12:09:01,099 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:01,099 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:01,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1041909303, now seen corresponding path program 23 times [2018-10-02 12:09:01,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:01,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:01,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-10-02 12:09:01,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:01,463 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:01,471 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:09:01,623 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-02 12:09:01,623 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:01,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-10-02 12:09:01,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:01,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-02 12:09:01,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-02 12:09:01,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-02 12:09:01,755 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:01,755 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 26 states. [2018-10-02 12:09:02,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:02,099 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2018-10-02 12:09:02,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-02 12:09:02,100 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 98 [2018-10-02 12:09:02,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:02,101 INFO L225 Difference]: With dead ends: 153 [2018-10-02 12:09:02,101 INFO L226 Difference]: Without dead ends: 103 [2018-10-02 12:09:02,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:09:02,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-02 12:09:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-10-02 12:09:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-02 12:09:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-10-02 12:09:02,107 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2018-10-02 12:09:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:02,107 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-10-02 12:09:02,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-02 12:09:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-10-02 12:09:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-02 12:09:02,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:02,108 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-10-02 12:09:02,108 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:02,108 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:02,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2122703189, now seen corresponding path program 24 times [2018-10-02 12:09:02,109 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:02,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:02,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:02,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:02,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-10-02 12:09:03,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:03,088 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:03,097 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:09:03,246 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-02 12:09:03,246 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:03,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-10-02 12:09:03,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:03,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-02 12:09:03,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-02 12:09:03,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-02 12:09:03,410 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:03,410 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 27 states. [2018-10-02 12:09:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:03,788 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-10-02 12:09:03,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 12:09:03,789 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2018-10-02 12:09:03,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:03,790 INFO L225 Difference]: With dead ends: 159 [2018-10-02 12:09:03,790 INFO L226 Difference]: Without dead ends: 107 [2018-10-02 12:09:03,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime [2018-10-02 12:09:03,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-02 12:09:03,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-10-02 12:09:03,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-02 12:09:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-10-02 12:09:03,795 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102 [2018-10-02 12:09:03,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:03,796 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-10-02 12:09:03,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-02 12:09:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-10-02 12:09:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-02 12:09:03,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:03,797 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-10-02 12:09:03,797 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:03,797 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:03,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1705231073, now seen corresponding path program 25 times [2018-10-02 12:09:03,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:03,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:03,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:03,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:03,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-10-02 12:09:04,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:04,111 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:04,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:09:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:04,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-10-02 12:09:04,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:04,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-02 12:09:04,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-02 12:09:04,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-02 12:09:04,304 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:04,304 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 28 states. [2018-10-02 12:09:04,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:04,818 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-10-02 12:09:04,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-02 12:09:04,818 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 106 [2018-10-02 12:09:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:04,819 INFO L225 Difference]: With dead ends: 165 [2018-10-02 12:09:04,819 INFO L226 Difference]: Without dead ends: 111 [2018-10-02 12:09:04,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:09:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-02 12:09:04,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-10-02 12:09:04,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-02 12:09:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-10-02 12:09:04,824 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2018-10-02 12:09:04,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:04,824 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-10-02 12:09:04,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-02 12:09:04,824 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-10-02 12:09:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-02 12:09:04,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:04,825 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-10-02 12:09:04,825 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:04,825 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:04,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1304797587, now seen corresponding path program 26 times [2018-10-02 12:09:04,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:04,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:04,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:04,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:09:04,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-10-02 12:09:05,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:05,353 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:05,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:09:05,409 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:09:05,409 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:05,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-10-02 12:09:05,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:05,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-02 12:09:05,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-02 12:09:05,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-02 12:09:05,548 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:05,548 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 29 states. [2018-10-02 12:09:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:06,004 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-10-02 12:09:06,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 12:09:06,005 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 110 [2018-10-02 12:09:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:06,006 INFO L225 Difference]: With dead ends: 171 [2018-10-02 12:09:06,006 INFO L226 Difference]: Without dead ends: 115 [2018-10-02 12:09:06,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:09:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-02 12:09:06,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-10-02 12:09:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-02 12:09:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-10-02 12:09:06,011 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2018-10-02 12:09:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:06,011 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-10-02 12:09:06,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-02 12:09:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-10-02 12:09:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-02 12:09:06,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:06,012 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-10-02 12:09:06,013 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:06,013 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:06,013 INFO L82 PathProgramCache]: Analyzing trace with hash -801420281, now seen corresponding path program 27 times [2018-10-02 12:09:06,013 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:06,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:06,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:06,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:06,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-10-02 12:09:06,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:06,616 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:06,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:09:06,834 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-02 12:09:06,834 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:06,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-10-02 12:09:07,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:07,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-02 12:09:07,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-02 12:09:07,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-02 12:09:07,027 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:07,027 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 30 states. [2018-10-02 12:09:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:07,388 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2018-10-02 12:09:07,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-02 12:09:07,388 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 114 [2018-10-02 12:09:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:07,389 INFO L225 Difference]: With dead ends: 177 [2018-10-02 12:09:07,389 INFO L226 Difference]: Without dead ends: 119 [2018-10-02 12:09:07,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime [2018-10-02 12:09:07,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-02 12:09:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-10-02 12:09:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-02 12:09:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-10-02 12:09:07,395 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2018-10-02 12:09:07,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:07,395 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-10-02 12:09:07,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-02 12:09:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-10-02 12:09:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-02 12:09:07,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:07,396 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-10-02 12:09:07,396 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:07,396 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:07,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2050868101, now seen corresponding path program 28 times [2018-10-02 12:09:07,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:07,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:07,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:07,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:07,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-10-02 12:09:08,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:08,693 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:08,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:09:08,751 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:09:08,751 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:08,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-10-02 12:09:08,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:08,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-02 12:09:08,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-02 12:09:08,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-02 12:09:08,906 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:08,906 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 31 states. [2018-10-02 12:09:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:09,283 INFO L93 Difference]: Finished difference Result 183 states and 186 transitions. [2018-10-02 12:09:09,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-02 12:09:09,284 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 118 [2018-10-02 12:09:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:09,285 INFO L225 Difference]: With dead ends: 183 [2018-10-02 12:09:09,285 INFO L226 Difference]: Without dead ends: 123 [2018-10-02 12:09:09,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime [2018-10-02 12:09:09,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-02 12:09:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-10-02 12:09:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-02 12:09:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-10-02 12:09:09,291 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 118 [2018-10-02 12:09:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:09,291 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-10-02 12:09:09,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-02 12:09:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-10-02 12:09:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-02 12:09:09,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:09,292 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-10-02 12:09:09,292 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:09,292 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:09,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1042320657, now seen corresponding path program 29 times [2018-10-02 12:09:09,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:09,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:09,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:09,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:09,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-10-02 12:09:10,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:10,093 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:10,102 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:09:10,482 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-02 12:09:10,483 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:10,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-10-02 12:09:10,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:10,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-02 12:09:10,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-02 12:09:10,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-02 12:09:10,635 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:10,635 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 32 states. [2018-10-02 12:09:11,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:11,021 INFO L93 Difference]: Finished difference Result 189 states and 192 transitions. [2018-10-02 12:09:11,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 12:09:11,023 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 122 [2018-10-02 12:09:11,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:11,024 INFO L225 Difference]: With dead ends: 189 [2018-10-02 12:09:11,025 INFO L226 Difference]: Without dead ends: 127 [2018-10-02 12:09:11,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime [2018-10-02 12:09:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-02 12:09:11,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-02 12:09:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-02 12:09:11,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-10-02 12:09:11,029 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2018-10-02 12:09:11,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:11,030 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-10-02 12:09:11,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-02 12:09:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-10-02 12:09:11,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-02 12:09:11,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:11,031 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-10-02 12:09:11,031 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:11,031 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:11,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2020085917, now seen corresponding path program 30 times [2018-10-02 12:09:11,031 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:11,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:11,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:11,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:11,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-02 12:09:11,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:11,788 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:11,797 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:09:11,970 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-02 12:09:11,971 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:11,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-02 12:09:12,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:12,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-02 12:09:12,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-02 12:09:12,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-02 12:09:12,118 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:12,119 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 33 states. [2018-10-02 12:09:12,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:12,539 INFO L93 Difference]: Finished difference Result 195 states and 198 transitions. [2018-10-02 12:09:12,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-02 12:09:12,540 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 126 [2018-10-02 12:09:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:12,541 INFO L225 Difference]: With dead ends: 195 [2018-10-02 12:09:12,541 INFO L226 Difference]: Without dead ends: 131 [2018-10-02 12:09:12,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime [2018-10-02 12:09:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-02 12:09:12,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-10-02 12:09:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-02 12:09:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-10-02 12:09:12,545 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 126 [2018-10-02 12:09:12,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:12,545 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-10-02 12:09:12,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-02 12:09:12,545 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-10-02 12:09:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-02 12:09:12,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:12,546 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-10-02 12:09:12,546 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:12,547 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:12,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1232122327, now seen corresponding path program 31 times [2018-10-02 12:09:12,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:12,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:12,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:12,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:12,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-10-02 12:09:13,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:13,254 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2018-10-02 12:09:13,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:13,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-10-02 12:09:13,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:13,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-02 12:09:13,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-02 12:09:13,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-02 12:09:13,611 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:13,611 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 34 states. [2018-10-02 12:09:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:15,182 INFO L93 Difference]: Finished difference Result 201 states and 204 transitions. [2018-10-02 12:09:15,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 12:09:15,182 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 130 [2018-10-02 12:09:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:15,183 INFO L225 Difference]: With dead ends: 201 [2018-10-02 12:09:15,183 INFO L226 Difference]: Without dead ends: 135 [2018-10-02 12:09:15,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime [2018-10-02 12:09:15,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-02 12:09:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-10-02 12:09:15,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-02 12:09:15,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-10-02 12:09:15,188 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 130 [2018-10-02 12:09:15,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:15,188 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-10-02 12:09:15,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-02 12:09:15,188 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-10-02 12:09:15,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-02 12:09:15,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:15,189 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-10-02 12:09:15,189 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:15,189 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:15,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1452361141, now seen corresponding path program 32 times [2018-10-02 12:09:15,190 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:15,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:15,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:15,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:09:15,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-10-02 12:09:15,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:15,744 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:15,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:09:15,805 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:09:15,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:15,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-10-02 12:09:15,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:15,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-02 12:09:15,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-02 12:09:15,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-02 12:09:15,958 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:15,958 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 35 states. [2018-10-02 12:09:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:16,389 INFO L93 Difference]: Finished difference Result 207 states and 210 transitions. [2018-10-02 12:09:16,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-02 12:09:16,390 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2018-10-02 12:09:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:16,391 INFO L225 Difference]: With dead ends: 207 [2018-10-02 12:09:16,391 INFO L226 Difference]: Without dead ends: 139 [2018-10-02 12:09:16,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime [2018-10-02 12:09:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-02 12:09:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-10-02 12:09:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-02 12:09:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-10-02 12:09:16,397 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2018-10-02 12:09:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:16,397 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-10-02 12:09:16,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-02 12:09:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-10-02 12:09:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-02 12:09:16,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:16,398 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-10-02 12:09:16,398 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:16,398 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:16,399 INFO L82 PathProgramCache]: Analyzing trace with hash 957810879, now seen corresponding path program 33 times [2018-10-02 12:09:16,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:16,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:16,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:16,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:16,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2018-10-02 12:09:17,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:17,190 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:17,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:09:17,502 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-02 12:09:17,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:17,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2018-10-02 12:09:17,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:17,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-02 12:09:17,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-02 12:09:17,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-02 12:09:17,713 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:17,714 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 36 states. [2018-10-02 12:09:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:18,143 INFO L93 Difference]: Finished difference Result 213 states and 216 transitions. [2018-10-02 12:09:18,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-02 12:09:18,144 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 138 [2018-10-02 12:09:18,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:18,145 INFO L225 Difference]: With dead ends: 213 [2018-10-02 12:09:18,145 INFO L226 Difference]: Without dead ends: 143 [2018-10-02 12:09:18,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime [2018-10-02 12:09:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-02 12:09:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-10-02 12:09:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-02 12:09:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-10-02 12:09:18,150 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 138 [2018-10-02 12:09:18,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:18,150 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-10-02 12:09:18,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-02 12:09:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-10-02 12:09:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-02 12:09:18,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:18,151 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-10-02 12:09:18,152 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:18,152 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:18,152 INFO L82 PathProgramCache]: Analyzing trace with hash 963550515, now seen corresponding path program 34 times [2018-10-02 12:09:18,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:18,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:18,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-10-02 12:09:19,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:19,267 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:19,275 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:09:19,335 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:09:19,336 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:19,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-10-02 12:09:19,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:19,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-02 12:09:19,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-02 12:09:19,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-02 12:09:19,496 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:19,496 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 37 states. [2018-10-02 12:09:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:20,164 INFO L93 Difference]: Finished difference Result 219 states and 222 transitions. [2018-10-02 12:09:20,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-02 12:09:20,164 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 142 [2018-10-02 12:09:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:20,165 INFO L225 Difference]: With dead ends: 219 [2018-10-02 12:09:20,165 INFO L226 Difference]: Without dead ends: 147 [2018-10-02 12:09:20,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.7s impTime [2018-10-02 12:09:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-02 12:09:20,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-10-02 12:09:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-02 12:09:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-10-02 12:09:20,169 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 142 [2018-10-02 12:09:20,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:20,169 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-10-02 12:09:20,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-02 12:09:20,170 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-10-02 12:09:20,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-02 12:09:20,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:20,170 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2018-10-02 12:09:20,171 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:20,171 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:20,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1526364071, now seen corresponding path program 35 times [2018-10-02 12:09:20,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:20,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:20,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:20,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:20,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2018-10-02 12:09:21,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:21,685 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:21,693 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:09:22,266 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-02 12:09:22,266 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:22,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2018-10-02 12:09:22,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:22,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-02 12:09:22,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-02 12:09:22,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-02 12:09:22,450 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:22,450 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 38 states. [2018-10-02 12:09:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:23,374 INFO L93 Difference]: Finished difference Result 225 states and 228 transitions. [2018-10-02 12:09:23,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-02 12:09:23,375 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 146 [2018-10-02 12:09:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:23,376 INFO L225 Difference]: With dead ends: 225 [2018-10-02 12:09:23,376 INFO L226 Difference]: Without dead ends: 151 [2018-10-02 12:09:23,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.2s impTime [2018-10-02 12:09:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-02 12:09:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-10-02 12:09:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-02 12:09:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-10-02 12:09:23,381 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 146 [2018-10-02 12:09:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:23,382 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-10-02 12:09:23,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-02 12:09:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-10-02 12:09:23,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-02 12:09:23,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:23,383 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1] [2018-10-02 12:09:23,383 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:23,383 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:23,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2109708315, now seen corresponding path program 36 times [2018-10-02 12:09:23,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:23,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:23,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:23,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:23,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2018-10-02 12:09:24,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:24,954 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:24,962 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:09:25,269 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-02 12:09:25,270 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:25,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2018-10-02 12:09:25,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:25,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-02 12:09:25,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-02 12:09:25,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-02 12:09:25,479 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:25,479 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 39 states. [2018-10-02 12:09:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:25,944 INFO L93 Difference]: Finished difference Result 231 states and 234 transitions. [2018-10-02 12:09:25,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 12:09:25,944 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-10-02 12:09:25,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:25,946 INFO L225 Difference]: With dead ends: 231 [2018-10-02 12:09:25,946 INFO L226 Difference]: Without dead ends: 155 [2018-10-02 12:09:25,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.2s impTime [2018-10-02 12:09:25,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-02 12:09:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-10-02 12:09:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-02 12:09:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-10-02 12:09:25,951 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 150 [2018-10-02 12:09:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:25,951 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-10-02 12:09:25,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-02 12:09:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-10-02 12:09:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-02 12:09:25,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:25,952 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2018-10-02 12:09:25,953 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:25,953 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:25,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1900215951, now seen corresponding path program 37 times [2018-10-02 12:09:25,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:25,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:25,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-10-02 12:09:26,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:26,708 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:26,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:09:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:26,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-10-02 12:09:26,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:26,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-02 12:09:26,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-02 12:09:26,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-02 12:09:26,970 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:26,970 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 40 states. [2018-10-02 12:09:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:27,480 INFO L93 Difference]: Finished difference Result 237 states and 240 transitions. [2018-10-02 12:09:27,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-02 12:09:27,481 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 154 [2018-10-02 12:09:27,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:27,482 INFO L225 Difference]: With dead ends: 237 [2018-10-02 12:09:27,482 INFO L226 Difference]: Without dead ends: 159 [2018-10-02 12:09:27,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime [2018-10-02 12:09:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-02 12:09:27,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-10-02 12:09:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-02 12:09:27,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-10-02 12:09:27,487 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2018-10-02 12:09:27,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:27,487 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-10-02 12:09:27,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-02 12:09:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-10-02 12:09:27,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-02 12:09:27,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:27,488 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1] [2018-10-02 12:09:27,488 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:27,488 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:27,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1266046205, now seen corresponding path program 38 times [2018-10-02 12:09:27,488 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:27,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:27,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:27,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:09:27,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:28,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-10-02 12:09:28,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:28,303 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:28,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:09:28,378 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:09:28,379 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:28,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-10-02 12:09:29,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:29,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-02 12:09:29,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-02 12:09:29,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-02 12:09:29,597 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:29,597 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 41 states. [2018-10-02 12:09:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:30,557 INFO L93 Difference]: Finished difference Result 243 states and 246 transitions. [2018-10-02 12:09:30,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-02 12:09:30,557 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 158 [2018-10-02 12:09:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:30,559 INFO L225 Difference]: With dead ends: 243 [2018-10-02 12:09:30,559 INFO L226 Difference]: Without dead ends: 163 [2018-10-02 12:09:30,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 0.5s impTime [2018-10-02 12:09:30,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-02 12:09:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-10-02 12:09:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-02 12:09:30,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-10-02 12:09:30,564 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 158 [2018-10-02 12:09:30,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:30,564 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-10-02 12:09:30,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-02 12:09:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-10-02 12:09:30,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-02 12:09:30,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:30,565 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2018-10-02 12:09:30,566 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:30,566 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:30,566 INFO L82 PathProgramCache]: Analyzing trace with hash 907582839, now seen corresponding path program 39 times [2018-10-02 12:09:30,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:30,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:30,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:30,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:30,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2018-10-02 12:09:31,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:31,451 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:31,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:09:31,940 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-02 12:09:31,940 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:31,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2018-10-02 12:09:32,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:32,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-02 12:09:32,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-02 12:09:32,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-02 12:09:32,131 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:32,132 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 42 states. [2018-10-02 12:09:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:32,805 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions. [2018-10-02 12:09:32,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-02 12:09:32,806 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2018-10-02 12:09:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:32,807 INFO L225 Difference]: With dead ends: 249 [2018-10-02 12:09:32,807 INFO L226 Difference]: Without dead ends: 167 [2018-10-02 12:09:32,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime [2018-10-02 12:09:32,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-02 12:09:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-10-02 12:09:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-02 12:09:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-10-02 12:09:32,813 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 162 [2018-10-02 12:09:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:32,813 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-10-02 12:09:32,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-02 12:09:32,813 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-10-02 12:09:32,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-02 12:09:32,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:32,814 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1] [2018-10-02 12:09:32,814 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:32,815 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:32,815 INFO L82 PathProgramCache]: Analyzing trace with hash 334812651, now seen corresponding path program 40 times [2018-10-02 12:09:32,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:32,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:32,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:32,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:32,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-10-02 12:09:33,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:33,656 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:33,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:09:33,729 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:09:33,729 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:33,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-10-02 12:09:33,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:33,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-02 12:09:33,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-02 12:09:33,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-02 12:09:33,968 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:33,968 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 43 states. [2018-10-02 12:09:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:34,732 INFO L93 Difference]: Finished difference Result 255 states and 258 transitions. [2018-10-02 12:09:34,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-02 12:09:34,732 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 166 [2018-10-02 12:09:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:34,734 INFO L225 Difference]: With dead ends: 255 [2018-10-02 12:09:34,734 INFO L226 Difference]: Without dead ends: 171 [2018-10-02 12:09:34,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime [2018-10-02 12:09:34,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-02 12:09:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-10-02 12:09:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-02 12:09:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-10-02 12:09:34,740 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 166 [2018-10-02 12:09:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:34,740 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-10-02 12:09:34,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-02 12:09:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-10-02 12:09:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-02 12:09:34,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:34,741 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1] [2018-10-02 12:09:34,741 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:34,741 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:34,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1537430623, now seen corresponding path program 41 times [2018-10-02 12:09:34,742 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:34,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:34,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:34,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:34,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-10-02 12:09:36,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:36,177 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:36,190 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:09:36,967 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-02 12:09:36,967 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:36,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-10-02 12:09:37,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:37,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-02 12:09:37,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-02 12:09:37,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-02 12:09:37,411 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:37,411 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 44 states. [2018-10-02 12:09:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:37,984 INFO L93 Difference]: Finished difference Result 261 states and 264 transitions. [2018-10-02 12:09:37,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-02 12:09:37,984 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 170 [2018-10-02 12:09:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:37,986 INFO L225 Difference]: With dead ends: 261 [2018-10-02 12:09:37,986 INFO L226 Difference]: Without dead ends: 175 [2018-10-02 12:09:37,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.1s impTime [2018-10-02 12:09:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-02 12:09:37,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-10-02 12:09:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-02 12:09:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-10-02 12:09:37,992 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 170 [2018-10-02 12:09:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:37,993 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-10-02 12:09:37,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-02 12:09:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-10-02 12:09:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-02 12:09:37,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:37,994 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1] [2018-10-02 12:09:37,994 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:37,994 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:37,994 INFO L82 PathProgramCache]: Analyzing trace with hash -903276333, now seen corresponding path program 42 times [2018-10-02 12:09:37,994 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:37,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:37,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:37,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:37,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2018-10-02 12:09:38,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:38,784 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2018-10-02 12:09:38,799 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:39,244 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-02 12:09:39,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:39,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2018-10-02 12:09:39,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:39,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-02 12:09:39,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-02 12:09:39,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-02 12:09:39,451 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:39,451 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 45 states. [2018-10-02 12:09:40,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:40,019 INFO L93 Difference]: Finished difference Result 267 states and 270 transitions. [2018-10-02 12:09:40,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-02 12:09:40,020 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 174 [2018-10-02 12:09:40,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:40,021 INFO L225 Difference]: With dead ends: 267 [2018-10-02 12:09:40,021 INFO L226 Difference]: Without dead ends: 179 [2018-10-02 12:09:40,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime [2018-10-02 12:09:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-02 12:09:40,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-10-02 12:09:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-02 12:09:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-10-02 12:09:40,027 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 174 [2018-10-02 12:09:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:40,027 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-10-02 12:09:40,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-02 12:09:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-10-02 12:09:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-02 12:09:40,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:40,028 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1] [2018-10-02 12:09:40,028 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:40,028 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:40,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1945427129, now seen corresponding path program 43 times [2018-10-02 12:09:40,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:40,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:40,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:40,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:40,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-10-02 12:09:41,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:41,033 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:41,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:09:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:41,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-10-02 12:09:41,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:41,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-02 12:09:41,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-02 12:09:41,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-02 12:09:41,332 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:41,332 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 46 states. [2018-10-02 12:09:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:41,953 INFO L93 Difference]: Finished difference Result 273 states and 276 transitions. [2018-10-02 12:09:41,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-02 12:09:41,954 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 178 [2018-10-02 12:09:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:41,955 INFO L225 Difference]: With dead ends: 273 [2018-10-02 12:09:41,956 INFO L226 Difference]: Without dead ends: 183 [2018-10-02 12:09:41,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime [2018-10-02 12:09:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-02 12:09:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-10-02 12:09:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-02 12:09:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-10-02 12:09:41,960 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 178 [2018-10-02 12:09:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:41,960 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-10-02 12:09:41,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-02 12:09:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-10-02 12:09:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-02 12:09:41,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:41,961 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1] [2018-10-02 12:09:41,961 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:41,961 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash -45190213, now seen corresponding path program 44 times [2018-10-02 12:09:41,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:41,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:41,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:41,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:09:41,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-10-02 12:09:42,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:42,874 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:42,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:09:42,957 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:09:42,957 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:42,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-10-02 12:09:43,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:43,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-02 12:09:43,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-02 12:09:43,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-02 12:09:43,175 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:43,175 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 47 states. [2018-10-02 12:09:43,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:43,797 INFO L93 Difference]: Finished difference Result 279 states and 282 transitions. [2018-10-02 12:09:43,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-02 12:09:43,797 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 182 [2018-10-02 12:09:43,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:43,799 INFO L225 Difference]: With dead ends: 279 [2018-10-02 12:09:43,799 INFO L226 Difference]: Without dead ends: 187 [2018-10-02 12:09:43,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime [2018-10-02 12:09:43,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-02 12:09:43,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-10-02 12:09:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-02 12:09:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-10-02 12:09:43,805 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 182 [2018-10-02 12:09:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:43,805 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-10-02 12:09:43,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-02 12:09:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-10-02 12:09:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-02 12:09:43,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:43,806 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1] [2018-10-02 12:09:43,807 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:43,807 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:43,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1769474607, now seen corresponding path program 45 times [2018-10-02 12:09:43,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:43,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:43,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:43,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:43,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:44,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2018-10-02 12:09:44,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:44,543 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:44,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:09:45,487 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-02 12:09:45,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:45,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2018-10-02 12:09:45,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:45,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-02 12:09:45,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-02 12:09:45,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-02 12:09:45,945 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:45,945 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 48 states. [2018-10-02 12:09:46,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:46,592 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2018-10-02 12:09:46,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-02 12:09:46,593 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 186 [2018-10-02 12:09:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:46,594 INFO L225 Difference]: With dead ends: 285 [2018-10-02 12:09:46,595 INFO L226 Difference]: Without dead ends: 191 [2018-10-02 12:09:46,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.5s impTime [2018-10-02 12:09:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-02 12:09:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-10-02 12:09:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-02 12:09:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-10-02 12:09:46,600 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 186 [2018-10-02 12:09:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:46,600 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-10-02 12:09:46,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-02 12:09:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-10-02 12:09:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-02 12:09:46,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:46,602 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1] [2018-10-02 12:09:46,602 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:46,602 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:46,602 INFO L82 PathProgramCache]: Analyzing trace with hash -879958365, now seen corresponding path program 46 times [2018-10-02 12:09:46,602 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:46,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:46,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:46,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:46,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-10-02 12:09:47,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:47,989 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:47,998 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:09:48,075 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:09:48,075 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:48,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-10-02 12:09:48,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:48,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-02 12:09:48,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-02 12:09:48,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-02 12:09:48,345 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:48,345 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 49 states. [2018-10-02 12:09:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:48,998 INFO L93 Difference]: Finished difference Result 291 states and 294 transitions. [2018-10-02 12:09:48,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-02 12:09:48,998 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 190 [2018-10-02 12:09:48,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:49,000 INFO L225 Difference]: With dead ends: 291 [2018-10-02 12:09:49,000 INFO L226 Difference]: Without dead ends: 195 [2018-10-02 12:09:49,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.9s impTime [2018-10-02 12:09:49,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-02 12:09:49,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-10-02 12:09:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-02 12:09:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-10-02 12:09:49,004 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 190 [2018-10-02 12:09:49,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:49,004 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-10-02 12:09:49,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-02 12:09:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-10-02 12:09:49,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-02 12:09:49,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:49,005 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1] [2018-10-02 12:09:49,006 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:49,006 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:49,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1911420649, now seen corresponding path program 47 times [2018-10-02 12:09:49,006 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:49,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:49,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:49,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:49,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-10-02 12:09:50,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:50,978 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:50,985 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:09:52,065 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-02 12:09:52,065 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:52,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-10-02 12:09:52,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:52,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-02 12:09:52,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-02 12:09:52,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-02 12:09:52,467 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:52,467 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 50 states. [2018-10-02 12:09:53,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:53,154 INFO L93 Difference]: Finished difference Result 297 states and 300 transitions. [2018-10-02 12:09:53,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-02 12:09:53,155 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 194 [2018-10-02 12:09:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:53,156 INFO L225 Difference]: With dead ends: 297 [2018-10-02 12:09:53,156 INFO L226 Difference]: Without dead ends: 199 [2018-10-02 12:09:53,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.6s impTime [2018-10-02 12:09:53,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-02 12:09:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-10-02 12:09:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-02 12:09:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-10-02 12:09:53,161 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 194 [2018-10-02 12:09:53,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:53,161 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-10-02 12:09:53,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-02 12:09:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-10-02 12:09:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-02 12:09:53,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:53,162 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1, 1, 1] [2018-10-02 12:09:53,163 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:53,163 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:53,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1259106699, now seen corresponding path program 48 times [2018-10-02 12:09:53,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:53,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:53,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:53,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:53,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2018-10-02 12:09:54,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:54,599 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:54,606 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:09:55,330 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-02 12:09:55,330 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:55,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2018-10-02 12:09:55,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:55,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-02 12:09:55,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-02 12:09:55,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-02 12:09:55,555 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:55,555 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 51 states. [2018-10-02 12:09:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:56,457 INFO L93 Difference]: Finished difference Result 303 states and 306 transitions. [2018-10-02 12:09:56,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-02 12:09:56,458 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 198 [2018-10-02 12:09:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:56,459 INFO L225 Difference]: With dead ends: 303 [2018-10-02 12:09:56,459 INFO L226 Difference]: Without dead ends: 203 [2018-10-02 12:09:56,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime [2018-10-02 12:09:56,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-02 12:09:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-10-02 12:09:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-02 12:09:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-10-02 12:09:56,466 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 198 [2018-10-02 12:09:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:56,467 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-10-02 12:09:56,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-02 12:09:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-10-02 12:09:56,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-02 12:09:56,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:56,468 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1] [2018-10-02 12:09:56,468 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:56,468 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:56,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1946083329, now seen corresponding path program 49 times [2018-10-02 12:09:56,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:56,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:56,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:56,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:09:56,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-10-02 12:09:57,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:57,374 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:57,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:09:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:57,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:09:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-10-02 12:09:57,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:09:57,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-02 12:09:57,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-02 12:09:57,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-02 12:09:57,680 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:09:57,680 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 52 states. [2018-10-02 12:09:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:09:58,370 INFO L93 Difference]: Finished difference Result 309 states and 312 transitions. [2018-10-02 12:09:58,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-02 12:09:58,371 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 202 [2018-10-02 12:09:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:09:58,372 INFO L225 Difference]: With dead ends: 309 [2018-10-02 12:09:58,373 INFO L226 Difference]: Without dead ends: 207 [2018-10-02 12:09:58,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime [2018-10-02 12:09:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-02 12:09:58,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-10-02 12:09:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-02 12:09:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-10-02 12:09:58,378 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 202 [2018-10-02 12:09:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:09:58,378 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-10-02 12:09:58,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-02 12:09:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-10-02 12:09:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-02 12:09:58,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:09:58,380 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1, 1, 1] [2018-10-02 12:09:58,380 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:09:58,380 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:09:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1980427149, now seen corresponding path program 50 times [2018-10-02 12:09:58,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:09:58,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:09:58,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:58,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:09:58,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:09:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:09:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-02 12:09:59,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:09:59,722 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:09:59,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:09:59,815 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:09:59,815 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:09:59,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:00,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-02 12:10:00,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:00,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-02 12:10:00,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-02 12:10:00,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-02 12:10:00,034 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:00,034 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 53 states. [2018-10-02 12:10:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:01,768 INFO L93 Difference]: Finished difference Result 315 states and 318 transitions. [2018-10-02 12:10:01,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-02 12:10:01,769 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 206 [2018-10-02 12:10:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:01,770 INFO L225 Difference]: With dead ends: 315 [2018-10-02 12:10:01,771 INFO L226 Difference]: Without dead ends: 211 [2018-10-02 12:10:01,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime [2018-10-02 12:10:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-02 12:10:01,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-10-02 12:10:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-02 12:10:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-10-02 12:10:01,776 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 206 [2018-10-02 12:10:01,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:01,776 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-10-02 12:10:01,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-02 12:10:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-10-02 12:10:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-02 12:10:01,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:01,778 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1] [2018-10-02 12:10:01,778 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:01,778 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:01,778 INFO L82 PathProgramCache]: Analyzing trace with hash -311603481, now seen corresponding path program 51 times [2018-10-02 12:10:01,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:01,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:01,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:01,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:01,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 2652 trivial. 0 not checked. [2018-10-02 12:10:02,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:02,812 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:02,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:10:03,978 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-02 12:10:03,979 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:03,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 2652 trivial. 0 not checked. [2018-10-02 12:10:04,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:04,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-02 12:10:04,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-02 12:10:04,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-02 12:10:04,928 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:04,928 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 54 states. [2018-10-02 12:10:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:05,761 INFO L93 Difference]: Finished difference Result 321 states and 324 transitions. [2018-10-02 12:10:05,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-02 12:10:05,761 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 210 [2018-10-02 12:10:05,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:05,763 INFO L225 Difference]: With dead ends: 321 [2018-10-02 12:10:05,763 INFO L226 Difference]: Without dead ends: 215 [2018-10-02 12:10:05,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 0.7s impTime [2018-10-02 12:10:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-02 12:10:05,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-10-02 12:10:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-02 12:10:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-10-02 12:10:05,768 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 210 [2018-10-02 12:10:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:05,768 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-10-02 12:10:05,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-02 12:10:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-10-02 12:10:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-02 12:10:05,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:05,769 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1, 1, 1] [2018-10-02 12:10:05,770 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:05,770 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:05,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1905340581, now seen corresponding path program 52 times [2018-10-02 12:10:05,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:05,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:05,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:05,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:05,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2018-10-02 12:10:07,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:07,329 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:07,336 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:10:07,426 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:10:07,426 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:07,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2018-10-02 12:10:07,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:07,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-02 12:10:07,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-02 12:10:07,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-02 12:10:07,665 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:07,665 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 55 states. [2018-10-02 12:10:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:08,464 INFO L93 Difference]: Finished difference Result 327 states and 330 transitions. [2018-10-02 12:10:08,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-02 12:10:08,465 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 214 [2018-10-02 12:10:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:08,466 INFO L225 Difference]: With dead ends: 327 [2018-10-02 12:10:08,466 INFO L226 Difference]: Without dead ends: 219 [2018-10-02 12:10:08,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.3s impTime [2018-10-02 12:10:08,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-02 12:10:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-10-02 12:10:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-02 12:10:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-10-02 12:10:08,471 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 214 [2018-10-02 12:10:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:08,471 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-10-02 12:10:08,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-02 12:10:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-10-02 12:10:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-02 12:10:08,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:08,472 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1] [2018-10-02 12:10:08,472 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:08,472 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:08,473 INFO L82 PathProgramCache]: Analyzing trace with hash 880711119, now seen corresponding path program 53 times [2018-10-02 12:10:08,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:08,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:08,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:08,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:08,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2018-10-02 12:10:09,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:09,842 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:09,852 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:10:11,697 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-02 12:10:11,697 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:11,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2018-10-02 12:10:12,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:12,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-02 12:10:12,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-02 12:10:12,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-02 12:10:12,006 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:12,006 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 56 states. [2018-10-02 12:10:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:12,796 INFO L93 Difference]: Finished difference Result 333 states and 336 transitions. [2018-10-02 12:10:12,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-02 12:10:12,796 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 218 [2018-10-02 12:10:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:12,798 INFO L225 Difference]: With dead ends: 333 [2018-10-02 12:10:12,798 INFO L226 Difference]: Without dead ends: 223 [2018-10-02 12:10:12,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime [2018-10-02 12:10:12,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-02 12:10:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-10-02 12:10:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-02 12:10:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-10-02 12:10:12,802 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 218 [2018-10-02 12:10:12,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:12,803 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-10-02 12:10:12,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-02 12:10:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-10-02 12:10:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-02 12:10:12,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:12,804 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1, 1, 1] [2018-10-02 12:10:12,804 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:12,804 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:12,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1453433411, now seen corresponding path program 54 times [2018-10-02 12:10:12,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:12,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:12,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:12,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:12,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-10-02 12:10:13,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:13,716 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:13,723 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:10:14,651 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-02 12:10:14,651 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:14,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-10-02 12:10:14,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:14,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-02 12:10:14,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-02 12:10:14,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-02 12:10:14,980 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:14,980 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 57 states. [2018-10-02 12:10:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:16,076 INFO L93 Difference]: Finished difference Result 339 states and 342 transitions. [2018-10-02 12:10:16,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-02 12:10:16,077 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 222 [2018-10-02 12:10:16,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:16,078 INFO L225 Difference]: With dead ends: 339 [2018-10-02 12:10:16,078 INFO L226 Difference]: Without dead ends: 227 [2018-10-02 12:10:16,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime [2018-10-02 12:10:16,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-02 12:10:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-10-02 12:10:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-02 12:10:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-10-02 12:10:16,086 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 222 [2018-10-02 12:10:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:16,087 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-10-02 12:10:16,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-02 12:10:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-10-02 12:10:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-02 12:10:16,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:16,088 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1] [2018-10-02 12:10:16,089 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:16,089 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:16,089 INFO L82 PathProgramCache]: Analyzing trace with hash -614665033, now seen corresponding path program 55 times [2018-10-02 12:10:16,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:16,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:16,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-02 12:10:17,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:17,438 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:17,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:10:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:17,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-02 12:10:17,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:17,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-02 12:10:17,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-02 12:10:17,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-02 12:10:17,790 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:17,791 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 58 states. [2018-10-02 12:10:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:18,625 INFO L93 Difference]: Finished difference Result 345 states and 348 transitions. [2018-10-02 12:10:18,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-02 12:10:18,625 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 226 [2018-10-02 12:10:18,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:18,627 INFO L225 Difference]: With dead ends: 345 [2018-10-02 12:10:18,627 INFO L226 Difference]: Without dead ends: 231 [2018-10-02 12:10:18,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime [2018-10-02 12:10:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-02 12:10:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-10-02 12:10:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-02 12:10:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-10-02 12:10:18,633 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 226 [2018-10-02 12:10:18,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:18,634 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-10-02 12:10:18,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-02 12:10:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-10-02 12:10:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-02 12:10:18,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:18,635 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1, 1, 1] [2018-10-02 12:10:18,635 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:18,635 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:18,636 INFO L82 PathProgramCache]: Analyzing trace with hash -659190485, now seen corresponding path program 56 times [2018-10-02 12:10:18,636 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:18,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:18,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:18,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:10:18,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2018-10-02 12:10:19,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:19,988 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:19,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:10:20,102 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:10:20,102 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:20,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2018-10-02 12:10:20,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:20,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-02 12:10:20,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-02 12:10:20,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-02 12:10:20,520 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:20,520 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 59 states. [2018-10-02 12:10:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:21,551 INFO L93 Difference]: Finished difference Result 351 states and 354 transitions. [2018-10-02 12:10:21,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-02 12:10:21,552 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 230 [2018-10-02 12:10:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:21,553 INFO L225 Difference]: With dead ends: 351 [2018-10-02 12:10:21,553 INFO L226 Difference]: Without dead ends: 235 [2018-10-02 12:10:21,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.1s impTime [2018-10-02 12:10:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-02 12:10:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-02 12:10:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-02 12:10:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-10-02 12:10:21,558 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 230 [2018-10-02 12:10:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:21,558 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-10-02 12:10:21,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-02 12:10:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-10-02 12:10:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-02 12:10:21,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:21,559 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1] [2018-10-02 12:10:21,560 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:21,560 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:21,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1412459423, now seen corresponding path program 57 times [2018-10-02 12:10:21,560 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:21,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:21,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:21,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:21,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2018-10-02 12:10:22,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:22,965 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:22,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:10:24,729 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-02 12:10:24,730 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:24,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2018-10-02 12:10:24,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:24,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-02 12:10:24,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-02 12:10:24,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-02 12:10:24,978 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:24,978 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 60 states. [2018-10-02 12:10:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:25,847 INFO L93 Difference]: Finished difference Result 357 states and 360 transitions. [2018-10-02 12:10:25,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-02 12:10:25,848 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 234 [2018-10-02 12:10:25,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:25,849 INFO L225 Difference]: With dead ends: 357 [2018-10-02 12:10:25,849 INFO L226 Difference]: Without dead ends: 239 [2018-10-02 12:10:25,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.2s impTime [2018-10-02 12:10:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-02 12:10:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-02 12:10:25,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-02 12:10:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-10-02 12:10:25,855 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 234 [2018-10-02 12:10:25,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:25,855 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-10-02 12:10:25,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-02 12:10:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-10-02 12:10:25,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-02 12:10:25,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:25,856 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1, 1, 1] [2018-10-02 12:10:25,856 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:25,857 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:25,857 INFO L82 PathProgramCache]: Analyzing trace with hash 47353875, now seen corresponding path program 58 times [2018-10-02 12:10:25,857 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:25,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:25,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:25,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:25,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3422 trivial. 0 not checked. [2018-10-02 12:10:26,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:26,622 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:26,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:10:26,727 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:10:26,728 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:26,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3422 trivial. 0 not checked. [2018-10-02 12:10:27,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:27,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-02 12:10:27,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-02 12:10:27,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-02 12:10:27,018 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:27,018 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 61 states. [2018-10-02 12:10:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:28,000 INFO L93 Difference]: Finished difference Result 363 states and 366 transitions. [2018-10-02 12:10:28,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-02 12:10:28,000 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 238 [2018-10-02 12:10:28,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:28,002 INFO L225 Difference]: With dead ends: 363 [2018-10-02 12:10:28,002 INFO L226 Difference]: Without dead ends: 243 [2018-10-02 12:10:28,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime [2018-10-02 12:10:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-02 12:10:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-10-02 12:10:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-02 12:10:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-10-02 12:10:28,007 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 238 [2018-10-02 12:10:28,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:28,008 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-10-02 12:10:28,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-02 12:10:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-10-02 12:10:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-02 12:10:28,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:28,009 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1] [2018-10-02 12:10:28,010 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:28,010 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:28,010 INFO L82 PathProgramCache]: Analyzing trace with hash 153156231, now seen corresponding path program 59 times [2018-10-02 12:10:28,010 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:28,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:28,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:28,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:28,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-02 12:10:28,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:28,713 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:28,722 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:10:31,280 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-02 12:10:31,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:31,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-02 12:10:31,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:31,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-02 12:10:31,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-02 12:10:31,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-02 12:10:31,593 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:31,593 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 62 states. [2018-10-02 12:10:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:32,886 INFO L93 Difference]: Finished difference Result 369 states and 372 transitions. [2018-10-02 12:10:32,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-02 12:10:32,886 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 242 [2018-10-02 12:10:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:32,888 INFO L225 Difference]: With dead ends: 369 [2018-10-02 12:10:32,888 INFO L226 Difference]: Without dead ends: 247 [2018-10-02 12:10:32,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime [2018-10-02 12:10:32,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-02 12:10:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-10-02 12:10:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-02 12:10:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-10-02 12:10:32,897 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 242 [2018-10-02 12:10:32,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:32,897 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-10-02 12:10:32,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-02 12:10:32,897 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-10-02 12:10:32,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-02 12:10:32,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:32,899 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1, 1, 1] [2018-10-02 12:10:32,899 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:32,899 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:32,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1155486981, now seen corresponding path program 60 times [2018-10-02 12:10:32,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:32,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:32,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:32,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:32,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 3660 trivial. 0 not checked. [2018-10-02 12:10:33,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:33,579 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:33,587 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:10:35,063 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-02 12:10:35,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:35,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 3660 trivial. 0 not checked. [2018-10-02 12:10:35,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:35,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-02 12:10:35,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-02 12:10:35,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-02 12:10:35,333 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:35,333 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 63 states. [2018-10-02 12:10:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:36,436 INFO L93 Difference]: Finished difference Result 375 states and 378 transitions. [2018-10-02 12:10:36,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-02 12:10:36,437 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 246 [2018-10-02 12:10:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:36,439 INFO L225 Difference]: With dead ends: 375 [2018-10-02 12:10:36,439 INFO L226 Difference]: Without dead ends: 251 [2018-10-02 12:10:36,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime [2018-10-02 12:10:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-02 12:10:36,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-10-02 12:10:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-02 12:10:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-10-02 12:10:36,444 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 246 [2018-10-02 12:10:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:36,444 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-10-02 12:10:36,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-02 12:10:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-10-02 12:10:36,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-02 12:10:36,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:36,445 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1] [2018-10-02 12:10:36,445 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:36,445 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:36,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1549181295, now seen corresponding path program 61 times [2018-10-02 12:10:36,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:36,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:36,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:36,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:36,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 3782 trivial. 0 not checked. [2018-10-02 12:10:37,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:37,807 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:37,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:10:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:37,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 3782 trivial. 0 not checked. [2018-10-02 12:10:38,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:38,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-02 12:10:38,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-02 12:10:38,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-02 12:10:38,180 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:38,180 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 64 states. [2018-10-02 12:10:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:39,278 INFO L93 Difference]: Finished difference Result 381 states and 384 transitions. [2018-10-02 12:10:39,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-02 12:10:39,279 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 250 [2018-10-02 12:10:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:39,280 INFO L225 Difference]: With dead ends: 381 [2018-10-02 12:10:39,280 INFO L226 Difference]: Without dead ends: 255 [2018-10-02 12:10:39,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.1s impTime [2018-10-02 12:10:39,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-02 12:10:39,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-10-02 12:10:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-02 12:10:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-10-02 12:10:39,285 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 250 [2018-10-02 12:10:39,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:39,285 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-10-02 12:10:39,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-02 12:10:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-10-02 12:10:39,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-02 12:10:39,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:39,286 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1, 1, 1] [2018-10-02 12:10:39,286 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:39,286 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:39,286 INFO L82 PathProgramCache]: Analyzing trace with hash -540549661, now seen corresponding path program 62 times [2018-10-02 12:10:39,286 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:39,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:39,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:39,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:10:39,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2018-10-02 12:10:39,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:39,974 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:39,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:10:40,087 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:10:40,087 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:40,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2018-10-02 12:10:40,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:40,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-02 12:10:40,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-02 12:10:40,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-02 12:10:40,351 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:40,351 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 65 states. [2018-10-02 12:10:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:41,452 INFO L93 Difference]: Finished difference Result 387 states and 390 transitions. [2018-10-02 12:10:41,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-02 12:10:41,453 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 254 [2018-10-02 12:10:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:41,454 INFO L225 Difference]: With dead ends: 387 [2018-10-02 12:10:41,454 INFO L226 Difference]: Without dead ends: 259 [2018-10-02 12:10:41,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime [2018-10-02 12:10:41,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-02 12:10:41,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-10-02 12:10:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-02 12:10:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-10-02 12:10:41,460 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 254 [2018-10-02 12:10:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:41,460 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-10-02 12:10:41,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-02 12:10:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-10-02 12:10:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-02 12:10:41,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:41,461 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1] [2018-10-02 12:10:41,462 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:41,462 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:41,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1476829097, now seen corresponding path program 63 times [2018-10-02 12:10:41,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:41,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:41,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:41,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:41,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2018-10-02 12:10:42,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:42,413 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:42,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:10:44,682 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-10-02 12:10:44,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:44,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2018-10-02 12:10:44,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:44,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-02 12:10:44,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-02 12:10:44,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-02 12:10:44,957 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:44,957 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 66 states. [2018-10-02 12:10:46,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:46,096 INFO L93 Difference]: Finished difference Result 393 states and 396 transitions. [2018-10-02 12:10:46,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-02 12:10:46,097 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 258 [2018-10-02 12:10:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:46,099 INFO L225 Difference]: With dead ends: 393 [2018-10-02 12:10:46,099 INFO L226 Difference]: Without dead ends: 263 [2018-10-02 12:10:46,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime [2018-10-02 12:10:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-02 12:10:46,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-10-02 12:10:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-02 12:10:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-10-02 12:10:46,105 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 258 [2018-10-02 12:10:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:46,106 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-10-02 12:10:46,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-02 12:10:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-10-02 12:10:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-02 12:10:46,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:46,107 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1, 1, 1] [2018-10-02 12:10:46,107 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:46,108 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:46,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1190144203, now seen corresponding path program 64 times [2018-10-02 12:10:46,108 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:46,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:46,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:46,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:46,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2018-10-02 12:10:47,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:47,595 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:47,603 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:10:47,707 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:10:47,707 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:47,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 4160 trivial. 0 not checked. [2018-10-02 12:10:47,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:47,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-02 12:10:47,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-02 12:10:47,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-02 12:10:47,977 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:47,978 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 67 states. [2018-10-02 12:10:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:49,131 INFO L93 Difference]: Finished difference Result 399 states and 402 transitions. [2018-10-02 12:10:49,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-02 12:10:49,132 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 262 [2018-10-02 12:10:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:49,133 INFO L225 Difference]: With dead ends: 399 [2018-10-02 12:10:49,133 INFO L226 Difference]: Without dead ends: 267 [2018-10-02 12:10:49,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime [2018-10-02 12:10:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-02 12:10:49,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-10-02 12:10:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-02 12:10:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-10-02 12:10:49,139 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 262 [2018-10-02 12:10:49,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:49,139 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-10-02 12:10:49,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-02 12:10:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-10-02 12:10:49,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-02 12:10:49,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:49,141 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1] [2018-10-02 12:10:49,141 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:49,142 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:49,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1043412799, now seen corresponding path program 65 times [2018-10-02 12:10:49,142 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:49,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:49,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:49,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:49,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-10-02 12:10:50,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:50,253 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:50,259 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:10:53,579 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-10-02 12:10:53,580 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:53,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-10-02 12:10:53,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:53,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-02 12:10:53,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-02 12:10:53,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-02 12:10:53,885 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:53,886 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 68 states. [2018-10-02 12:10:55,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:55,328 INFO L93 Difference]: Finished difference Result 405 states and 408 transitions. [2018-10-02 12:10:55,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-02 12:10:55,328 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 266 [2018-10-02 12:10:55,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:55,330 INFO L225 Difference]: With dead ends: 405 [2018-10-02 12:10:55,330 INFO L226 Difference]: Without dead ends: 271 [2018-10-02 12:10:55,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime [2018-10-02 12:10:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-02 12:10:55,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-10-02 12:10:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-02 12:10:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-10-02 12:10:55,336 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 266 [2018-10-02 12:10:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:55,336 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-10-02 12:10:55,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-02 12:10:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-10-02 12:10:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-02 12:10:55,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:55,338 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1, 1, 1] [2018-10-02 12:10:55,338 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:55,338 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:55,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1094612045, now seen corresponding path program 66 times [2018-10-02 12:10:55,339 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:55,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:55,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:55,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:55,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:10:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2018-10-02 12:10:56,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:10:56,396 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:10:56,403 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:10:58,142 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-10-02 12:10:58,142 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:10:58,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:10:58,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2018-10-02 12:10:58,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:10:58,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-02 12:10:58,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-02 12:10:58,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-02 12:10:58,429 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:10:58,429 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 69 states. [2018-10-02 12:10:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:10:59,625 INFO L93 Difference]: Finished difference Result 411 states and 414 transitions. [2018-10-02 12:10:59,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-02 12:10:59,626 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 270 [2018-10-02 12:10:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:10:59,627 INFO L225 Difference]: With dead ends: 411 [2018-10-02 12:10:59,628 INFO L226 Difference]: Without dead ends: 275 [2018-10-02 12:10:59,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime [2018-10-02 12:10:59,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-02 12:10:59,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-10-02 12:10:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-02 12:10:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-10-02 12:10:59,633 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 270 [2018-10-02 12:10:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:10:59,633 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-10-02 12:10:59,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-02 12:10:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-10-02 12:10:59,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-02 12:10:59,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:10:59,635 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1, 1, 1] [2018-10-02 12:10:59,635 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:10:59,636 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:10:59,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1764107815, now seen corresponding path program 67 times [2018-10-02 12:10:59,636 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:10:59,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:10:59,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:59,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:10:59,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:10:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 4556 trivial. 0 not checked. [2018-10-02 12:11:00,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:00,774 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:11:00,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:11:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:00,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:01,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 4556 trivial. 0 not checked. [2018-10-02 12:11:01,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:01,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-02 12:11:01,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-02 12:11:01,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-02 12:11:01,216 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:01,216 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 70 states. [2018-10-02 12:11:02,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:02,877 INFO L93 Difference]: Finished difference Result 417 states and 420 transitions. [2018-10-02 12:11:02,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-02 12:11:02,878 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 274 [2018-10-02 12:11:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:02,880 INFO L225 Difference]: With dead ends: 417 [2018-10-02 12:11:02,880 INFO L226 Difference]: Without dead ends: 279 [2018-10-02 12:11:02,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime [2018-10-02 12:11:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-02 12:11:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-10-02 12:11:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-02 12:11:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-10-02 12:11:02,886 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 274 [2018-10-02 12:11:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:02,887 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-10-02 12:11:02,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-02 12:11:02,887 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-10-02 12:11:02,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-02 12:11:02,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:02,888 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1, 1, 1] [2018-10-02 12:11:02,889 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:02,889 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:02,889 INFO L82 PathProgramCache]: Analyzing trace with hash 224659099, now seen corresponding path program 68 times [2018-10-02 12:11:02,889 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:02,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:02,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:02,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:11:02,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 4692 trivial. 0 not checked. [2018-10-02 12:11:04,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:04,081 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:11:04,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:11:04,199 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:11:04,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:04,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 4692 trivial. 0 not checked. [2018-10-02 12:11:04,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:04,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-02 12:11:04,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-02 12:11:04,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-02 12:11:04,491 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:04,491 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 71 states. [2018-10-02 12:11:05,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:05,791 INFO L93 Difference]: Finished difference Result 423 states and 426 transitions. [2018-10-02 12:11:05,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-02 12:11:05,791 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 278 [2018-10-02 12:11:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:05,793 INFO L225 Difference]: With dead ends: 423 [2018-10-02 12:11:05,793 INFO L226 Difference]: Without dead ends: 283 [2018-10-02 12:11:05,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime [2018-10-02 12:11:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-02 12:11:05,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-10-02 12:11:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-02 12:11:05,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-10-02 12:11:05,798 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 278 [2018-10-02 12:11:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:05,799 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-10-02 12:11:05,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-02 12:11:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-10-02 12:11:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-02 12:11:05,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:05,800 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1, 1, 1] [2018-10-02 12:11:05,800 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:05,800 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:05,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1795173647, now seen corresponding path program 69 times [2018-10-02 12:11:05,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:05,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:05,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:05,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:05,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:06,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 4830 trivial. 0 not checked. [2018-10-02 12:11:06,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:06,575 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:11:06,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:11:10,042 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-10-02 12:11:10,042 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:10,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 4830 trivial. 0 not checked. [2018-10-02 12:11:10,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:10,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-02 12:11:10,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-02 12:11:10,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-02 12:11:10,629 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:10,630 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 72 states. [2018-10-02 12:11:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:11,906 INFO L93 Difference]: Finished difference Result 429 states and 432 transitions. [2018-10-02 12:11:11,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-02 12:11:11,906 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 282 [2018-10-02 12:11:11,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:11,908 INFO L225 Difference]: With dead ends: 429 [2018-10-02 12:11:11,908 INFO L226 Difference]: Without dead ends: 287 [2018-10-02 12:11:11,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.5s impTime [2018-10-02 12:11:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-02 12:11:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-10-02 12:11:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-02 12:11:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-10-02 12:11:11,912 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 282 [2018-10-02 12:11:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:11,913 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-10-02 12:11:11,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-02 12:11:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-10-02 12:11:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-02 12:11:11,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:11,914 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1, 1, 1] [2018-10-02 12:11:11,914 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:11,914 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:11,914 INFO L82 PathProgramCache]: Analyzing trace with hash -251684477, now seen corresponding path program 70 times [2018-10-02 12:11:11,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:11,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:11,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:11,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:11,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 4970 trivial. 0 not checked. [2018-10-02 12:11:13,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:13,009 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:11:13,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:11:13,132 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:11:13,133 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:13,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 4970 trivial. 0 not checked. [2018-10-02 12:11:13,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:13,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-02 12:11:13,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-02 12:11:13,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-02 12:11:13,433 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:13,433 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 73 states. [2018-10-02 12:11:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:14,743 INFO L93 Difference]: Finished difference Result 435 states and 438 transitions. [2018-10-02 12:11:14,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-02 12:11:14,743 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 286 [2018-10-02 12:11:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:14,745 INFO L225 Difference]: With dead ends: 435 [2018-10-02 12:11:14,745 INFO L226 Difference]: Without dead ends: 291 [2018-10-02 12:11:14,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime [2018-10-02 12:11:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-02 12:11:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-10-02 12:11:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-02 12:11:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 292 transitions. [2018-10-02 12:11:14,751 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 292 transitions. Word has length 286 [2018-10-02 12:11:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:14,751 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 292 transitions. [2018-10-02 12:11:14,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-02 12:11:14,751 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 292 transitions. [2018-10-02 12:11:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-02 12:11:14,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:14,752 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1, 1, 1] [2018-10-02 12:11:14,753 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:14,753 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:14,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2112310263, now seen corresponding path program 71 times [2018-10-02 12:11:14,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:14,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:14,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:14,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:14,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 5112 trivial. 0 not checked. [2018-10-02 12:11:16,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:16,143 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:11:16,150 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:11:21,037 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-10-02 12:11:21,037 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:21,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 5112 trivial. 0 not checked. [2018-10-02 12:11:21,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:21,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-02 12:11:21,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-02 12:11:21,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-02 12:11:21,382 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:21,382 INFO L87 Difference]: Start difference. First operand 291 states and 292 transitions. Second operand 74 states. [2018-10-02 12:11:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:22,864 INFO L93 Difference]: Finished difference Result 441 states and 444 transitions. [2018-10-02 12:11:22,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-02 12:11:22,865 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 290 [2018-10-02 12:11:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:22,866 INFO L225 Difference]: With dead ends: 441 [2018-10-02 12:11:22,866 INFO L226 Difference]: Without dead ends: 295 [2018-10-02 12:11:22,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime [2018-10-02 12:11:22,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-02 12:11:22,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-10-02 12:11:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-02 12:11:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-10-02 12:11:22,872 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 290 [2018-10-02 12:11:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:22,872 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-10-02 12:11:22,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-02 12:11:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-10-02 12:11:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-02 12:11:22,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:22,874 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1, 1, 1] [2018-10-02 12:11:22,875 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:22,875 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash 532431979, now seen corresponding path program 72 times [2018-10-02 12:11:22,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:22,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:22,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:22,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:22,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2018-10-02 12:11:23,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:23,790 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:11:23,797 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:11:26,567 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-10-02 12:11:26,567 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:26,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2018-10-02 12:11:26,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:26,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-02 12:11:26,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-02 12:11:26,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-02 12:11:26,947 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:26,947 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 75 states. [2018-10-02 12:11:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:28,492 INFO L93 Difference]: Finished difference Result 447 states and 450 transitions. [2018-10-02 12:11:28,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-02 12:11:28,493 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 294 [2018-10-02 12:11:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:28,495 INFO L225 Difference]: With dead ends: 447 [2018-10-02 12:11:28,495 INFO L226 Difference]: Without dead ends: 299 [2018-10-02 12:11:28,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime [2018-10-02 12:11:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-02 12:11:28,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-10-02 12:11:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-02 12:11:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-10-02 12:11:28,500 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 294 [2018-10-02 12:11:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:28,501 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-10-02 12:11:28,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-02 12:11:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-10-02 12:11:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-02 12:11:28,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:28,503 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1, 1, 1] [2018-10-02 12:11:28,503 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:28,503 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:28,503 INFO L82 PathProgramCache]: Analyzing trace with hash -737967393, now seen corresponding path program 73 times [2018-10-02 12:11:28,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:28,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:28,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:28,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:28,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-02 12:11:29,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:29,379 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:11:29,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:11:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:29,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:29,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-02 12:11:29,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:29,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-02 12:11:29,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-02 12:11:29,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-02 12:11:29,832 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:29,832 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 76 states. [2018-10-02 12:11:31,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:31,355 INFO L93 Difference]: Finished difference Result 453 states and 456 transitions. [2018-10-02 12:11:31,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-02 12:11:31,356 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 298 [2018-10-02 12:11:31,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:31,358 INFO L225 Difference]: With dead ends: 453 [2018-10-02 12:11:31,358 INFO L226 Difference]: Without dead ends: 303 [2018-10-02 12:11:31,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime [2018-10-02 12:11:31,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-02 12:11:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-10-02 12:11:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-02 12:11:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-10-02 12:11:31,364 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 298 [2018-10-02 12:11:31,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:31,364 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-10-02 12:11:31,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-02 12:11:31,364 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-10-02 12:11:31,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-02 12:11:31,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:31,366 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1, 1, 1] [2018-10-02 12:11:31,366 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:31,366 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:31,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1203898195, now seen corresponding path program 74 times [2018-10-02 12:11:31,366 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:31,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:31,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:31,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:11:31,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 5550 trivial. 0 not checked. [2018-10-02 12:11:32,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:32,457 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:11:32,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:11:32,590 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:11:32,590 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:32,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 5550 trivial. 0 not checked. [2018-10-02 12:11:32,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:32,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-02 12:11:32,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-02 12:11:32,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-02 12:11:32,927 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:32,927 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 77 states. [2018-10-02 12:11:34,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:34,542 INFO L93 Difference]: Finished difference Result 459 states and 462 transitions. [2018-10-02 12:11:34,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-02 12:11:34,542 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 302 [2018-10-02 12:11:34,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:34,544 INFO L225 Difference]: With dead ends: 459 [2018-10-02 12:11:34,544 INFO L226 Difference]: Without dead ends: 307 [2018-10-02 12:11:34,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime [2018-10-02 12:11:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-02 12:11:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-10-02 12:11:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-02 12:11:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-10-02 12:11:34,549 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 302 [2018-10-02 12:11:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:34,549 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-10-02 12:11:34,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-02 12:11:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-10-02 12:11:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-02 12:11:34,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:34,551 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1, 1, 1] [2018-10-02 12:11:34,551 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:34,551 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:34,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1753427513, now seen corresponding path program 75 times [2018-10-02 12:11:34,551 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:34,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:34,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:34,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:34,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2018-10-02 12:11:35,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:35,903 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:11:35,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:11:40,528 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-10-02 12:11:40,529 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:40,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2018-10-02 12:11:40,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:40,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-02 12:11:40,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-02 12:11:40,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-02 12:11:40,861 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:40,861 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 78 states. [2018-10-02 12:11:42,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:42,411 INFO L93 Difference]: Finished difference Result 465 states and 468 transitions. [2018-10-02 12:11:42,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-02 12:11:42,411 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 306 [2018-10-02 12:11:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:42,413 INFO L225 Difference]: With dead ends: 465 [2018-10-02 12:11:42,413 INFO L226 Difference]: Without dead ends: 311 [2018-10-02 12:11:42,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.1s impTime [2018-10-02 12:11:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-02 12:11:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-10-02 12:11:42,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-02 12:11:42,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2018-10-02 12:11:42,418 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 306 [2018-10-02 12:11:42,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:42,419 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2018-10-02 12:11:42,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-02 12:11:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2018-10-02 12:11:42,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-02 12:11:42,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:42,420 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1, 1, 1] [2018-10-02 12:11:42,420 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:42,420 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:42,420 INFO L82 PathProgramCache]: Analyzing trace with hash 255386171, now seen corresponding path program 76 times [2018-10-02 12:11:42,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:42,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:42,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:42,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:42,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 5852 trivial. 0 not checked. [2018-10-02 12:11:44,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:44,092 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:11:44,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:11:44,227 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:11:44,227 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:44,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 5852 trivial. 0 not checked. [2018-10-02 12:11:44,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:44,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-02 12:11:44,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-02 12:11:44,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-02 12:11:44,571 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:44,571 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 79 states. [2018-10-02 12:11:46,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:46,195 INFO L93 Difference]: Finished difference Result 471 states and 474 transitions. [2018-10-02 12:11:46,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-02 12:11:46,195 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 310 [2018-10-02 12:11:46,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:46,197 INFO L225 Difference]: With dead ends: 471 [2018-10-02 12:11:46,197 INFO L226 Difference]: Without dead ends: 315 [2018-10-02 12:11:46,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.4s impTime [2018-10-02 12:11:46,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-02 12:11:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-10-02 12:11:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-02 12:11:46,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-10-02 12:11:46,204 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 310 [2018-10-02 12:11:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:46,205 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-10-02 12:11:46,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-02 12:11:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-10-02 12:11:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-02 12:11:46,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:46,206 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1, 1, 1] [2018-10-02 12:11:46,207 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:46,207 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:46,207 INFO L82 PathProgramCache]: Analyzing trace with hash -361023313, now seen corresponding path program 77 times [2018-10-02 12:11:46,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:46,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:46,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:46,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:46,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2018-10-02 12:11:47,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:47,678 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:11:47,685 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:11:56,750 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-10-02 12:11:56,751 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:11:56,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:11:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2018-10-02 12:11:57,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:11:57,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-02 12:11:57,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-02 12:11:57,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-02 12:11:57,104 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:11:57,104 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 80 states. [2018-10-02 12:11:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:11:58,872 INFO L93 Difference]: Finished difference Result 477 states and 480 transitions. [2018-10-02 12:11:58,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-02 12:11:58,873 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 314 [2018-10-02 12:11:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:11:58,874 INFO L225 Difference]: With dead ends: 477 [2018-10-02 12:11:58,874 INFO L226 Difference]: Without dead ends: 319 [2018-10-02 12:11:58,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime [2018-10-02 12:11:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-02 12:11:58,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-10-02 12:11:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-02 12:11:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-10-02 12:11:58,879 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 314 [2018-10-02 12:11:58,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:11:58,879 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-10-02 12:11:58,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-02 12:11:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-10-02 12:11:58,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-02 12:11:58,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:11:58,881 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1, 1, 1] [2018-10-02 12:11:58,881 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:11:58,881 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:11:58,881 INFO L82 PathProgramCache]: Analyzing trace with hash 340317475, now seen corresponding path program 78 times [2018-10-02 12:11:58,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:11:58,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:11:58,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:58,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:11:58,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:11:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:11:59,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 6162 trivial. 0 not checked. [2018-10-02 12:11:59,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:11:59,911 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:11:59,918 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:12:03,212 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-10-02 12:12:03,212 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:12:03,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:12:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 6162 trivial. 0 not checked. [2018-10-02 12:12:03,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:12:03,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-10-02 12:12:03,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-02 12:12:03,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-02 12:12:03,560 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:12:03,560 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 81 states. [2018-10-02 12:12:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:12:05,313 INFO L93 Difference]: Finished difference Result 483 states and 486 transitions. [2018-10-02 12:12:05,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-02 12:12:05,313 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 318 [2018-10-02 12:12:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:12:05,315 INFO L225 Difference]: With dead ends: 483 [2018-10-02 12:12:05,315 INFO L226 Difference]: Without dead ends: 323 [2018-10-02 12:12:05,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.7s impTime [2018-10-02 12:12:05,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-02 12:12:05,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-10-02 12:12:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-02 12:12:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 324 transitions. [2018-10-02 12:12:05,320 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 324 transitions. Word has length 318 [2018-10-02 12:12:05,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:12:05,320 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 324 transitions. [2018-10-02 12:12:05,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-02 12:12:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 324 transitions. [2018-10-02 12:12:05,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-02 12:12:05,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:12:05,321 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1, 1, 1] [2018-10-02 12:12:05,321 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:12:05,321 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:12:05,322 INFO L82 PathProgramCache]: Analyzing trace with hash -416893033, now seen corresponding path program 79 times [2018-10-02 12:12:05,322 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:12:05,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:12:05,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:05,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:12:05,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:12:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 6320 trivial. 0 not checked. [2018-10-02 12:12:06,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:12:06,574 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:12:06,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:12:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:12:06,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:12:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 6320 trivial. 0 not checked. [2018-10-02 12:12:07,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:12:07,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-02 12:12:07,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-02 12:12:07,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-02 12:12:07,039 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:12:07,039 INFO L87 Difference]: Start difference. First operand 323 states and 324 transitions. Second operand 82 states. [2018-10-02 12:12:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:12:09,027 INFO L93 Difference]: Finished difference Result 489 states and 492 transitions. [2018-10-02 12:12:09,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-02 12:12:09,027 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 322 [2018-10-02 12:12:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:12:09,029 INFO L225 Difference]: With dead ends: 489 [2018-10-02 12:12:09,029 INFO L226 Difference]: Without dead ends: 327 [2018-10-02 12:12:09,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime [2018-10-02 12:12:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-02 12:12:09,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-10-02 12:12:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-02 12:12:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-10-02 12:12:09,033 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 322 [2018-10-02 12:12:09,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:12:09,033 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-10-02 12:12:09,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-02 12:12:09,033 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-10-02 12:12:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-02 12:12:09,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:12:09,035 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1, 1, 1] [2018-10-02 12:12:09,035 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:12:09,035 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:12:09,035 INFO L82 PathProgramCache]: Analyzing trace with hash -317071349, now seen corresponding path program 80 times [2018-10-02 12:12:09,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:12:09,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:12:09,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:09,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:12:09,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:12:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 6480 trivial. 0 not checked. [2018-10-02 12:12:10,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:12:10,340 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:12:10,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:12:10,477 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:12:10,478 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:12:10,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:12:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 6480 trivial. 0 not checked. [2018-10-02 12:12:10,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:12:10,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2018-10-02 12:12:10,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-02 12:12:10,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-02 12:12:10,843 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:12:10,844 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 83 states. [2018-10-02 12:12:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:12:12,856 INFO L93 Difference]: Finished difference Result 495 states and 498 transitions. [2018-10-02 12:12:12,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-02 12:12:12,856 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 326 [2018-10-02 12:12:12,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:12:12,858 INFO L225 Difference]: With dead ends: 495 [2018-10-02 12:12:12,858 INFO L226 Difference]: Without dead ends: 331 [2018-10-02 12:12:12,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime [2018-10-02 12:12:12,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-02 12:12:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-10-02 12:12:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-02 12:12:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 332 transitions. [2018-10-02 12:12:12,863 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 332 transitions. Word has length 326 [2018-10-02 12:12:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:12:12,864 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 332 transitions. [2018-10-02 12:12:12,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-02 12:12:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 332 transitions. [2018-10-02 12:12:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-02 12:12:12,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:12:12,865 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1, 1, 1] [2018-10-02 12:12:12,865 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:12:12,865 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:12:12,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1616425345, now seen corresponding path program 81 times [2018-10-02 12:12:12,866 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:12:12,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:12:12,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:12,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:12:12,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:12:13,964 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 6642 trivial. 0 not checked. [2018-10-02 12:12:13,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:12:13,964 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:12:13,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:12:20,206 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-10-02 12:12:20,206 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:12:20,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:12:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 6642 trivial. 0 not checked. [2018-10-02 12:12:20,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:12:20,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-10-02 12:12:20,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-02 12:12:20,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-02 12:12:20,563 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:12:20,563 INFO L87 Difference]: Start difference. First operand 331 states and 332 transitions. Second operand 84 states. [2018-10-02 12:12:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:12:22,217 INFO L93 Difference]: Finished difference Result 501 states and 504 transitions. [2018-10-02 12:12:22,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-02 12:12:22,217 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 330 [2018-10-02 12:12:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:12:22,219 INFO L225 Difference]: With dead ends: 501 [2018-10-02 12:12:22,219 INFO L226 Difference]: Without dead ends: 335 [2018-10-02 12:12:22,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime [2018-10-02 12:12:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-02 12:12:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-10-02 12:12:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-02 12:12:22,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-10-02 12:12:22,225 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 330 [2018-10-02 12:12:22,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:12:22,225 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-10-02 12:12:22,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-02 12:12:22,225 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-10-02 12:12:22,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-02 12:12:22,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:12:22,227 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1, 1, 1] [2018-10-02 12:12:22,227 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:12:22,227 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:12:22,227 INFO L82 PathProgramCache]: Analyzing trace with hash 668205811, now seen corresponding path program 82 times [2018-10-02 12:12:22,227 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:12:22,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:12:22,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:22,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:12:22,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:12:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 6806 trivial. 0 not checked. [2018-10-02 12:12:23,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:12:23,773 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:12:23,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:12:23,918 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:12:23,918 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:12:23,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:12:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 6806 trivial. 0 not checked. [2018-10-02 12:12:24,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:12:24,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2018-10-02 12:12:24,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-02 12:12:24,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-02 12:12:24,443 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:12:24,443 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 85 states. [2018-10-02 12:12:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:12:26,682 INFO L93 Difference]: Finished difference Result 507 states and 510 transitions. [2018-10-02 12:12:26,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-02 12:12:26,683 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 334 [2018-10-02 12:12:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:12:26,685 INFO L225 Difference]: With dead ends: 507 [2018-10-02 12:12:26,685 INFO L226 Difference]: Without dead ends: 339 [2018-10-02 12:12:26,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.2s impTime [2018-10-02 12:12:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-02 12:12:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-10-02 12:12:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-02 12:12:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 340 transitions. [2018-10-02 12:12:26,690 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 340 transitions. Word has length 334 [2018-10-02 12:12:26,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:12:26,690 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 340 transitions. [2018-10-02 12:12:26,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-02 12:12:26,690 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 340 transitions. [2018-10-02 12:12:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-02 12:12:26,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:12:26,692 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1, 1, 1] [2018-10-02 12:12:26,692 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:12:26,692 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:12:26,692 INFO L82 PathProgramCache]: Analyzing trace with hash 505740647, now seen corresponding path program 83 times [2018-10-02 12:12:26,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:12:26,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:12:26,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:26,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:12:26,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:12:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 6972 trivial. 0 not checked. [2018-10-02 12:12:28,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:12:28,328 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:12:28,337 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:12:37,295 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2018-10-02 12:12:37,295 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:12:37,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:12:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 6972 trivial. 0 not checked. [2018-10-02 12:12:37,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:12:37,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2018-10-02 12:12:37,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-02 12:12:37,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-02 12:12:37,688 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:12:37,688 INFO L87 Difference]: Start difference. First operand 339 states and 340 transitions. Second operand 86 states. [2018-10-02 12:12:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:12:39,806 INFO L93 Difference]: Finished difference Result 513 states and 516 transitions. [2018-10-02 12:12:39,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-02 12:12:39,806 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 338 [2018-10-02 12:12:39,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:12:39,807 INFO L225 Difference]: With dead ends: 513 [2018-10-02 12:12:39,808 INFO L226 Difference]: Without dead ends: 343 [2018-10-02 12:12:39,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.3s impTime [2018-10-02 12:12:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-02 12:12:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-10-02 12:12:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-02 12:12:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-10-02 12:12:39,813 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 338 [2018-10-02 12:12:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:12:39,813 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-10-02 12:12:39,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-02 12:12:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-10-02 12:12:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-02 12:12:39,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:12:39,814 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1, 1, 1] [2018-10-02 12:12:39,814 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:12:39,815 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:12:39,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1251950043, now seen corresponding path program 84 times [2018-10-02 12:12:39,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:12:39,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:12:39,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:39,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:12:39,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:12:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2018-10-02 12:12:41,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:12:41,225 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:12:41,238 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:12:45,800 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2018-10-02 12:12:45,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:12:45,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:12:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2018-10-02 12:12:46,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:12:46,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2018-10-02 12:12:46,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-02 12:12:46,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-02 12:12:46,182 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:12:46,182 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 87 states. [2018-10-02 12:12:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:12:48,324 INFO L93 Difference]: Finished difference Result 519 states and 522 transitions. [2018-10-02 12:12:48,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-02 12:12:48,324 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 342 [2018-10-02 12:12:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:12:48,326 INFO L225 Difference]: With dead ends: 519 [2018-10-02 12:12:48,326 INFO L226 Difference]: Without dead ends: 347 [2018-10-02 12:12:48,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.0s impTime [2018-10-02 12:12:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-02 12:12:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-10-02 12:12:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-02 12:12:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2018-10-02 12:12:48,331 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 342 [2018-10-02 12:12:48,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:12:48,331 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 348 transitions. [2018-10-02 12:12:48,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-02 12:12:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 348 transitions. [2018-10-02 12:12:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-02 12:12:48,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:12:48,333 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1, 1, 1] [2018-10-02 12:12:48,333 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:12:48,333 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:12:48,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1690813519, now seen corresponding path program 85 times [2018-10-02 12:12:48,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:12:48,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:12:48,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:48,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:12:48,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:12:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-02 12:12:49,878 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 12:12:49,881 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 12:12:49,882 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:12:49 BoogieIcfgContainer [2018-10-02 12:12:49,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:12:49,883 INFO L168 Benchmark]: Toolchain (without parser) took 248165.34 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -28.3 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 20.9 MB). Peak memory consumption was 570.9 MB. Max. memory is 7.1 GB. [2018-10-02 12:12:49,884 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:12:49,885 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:12:49,885 INFO L168 Benchmark]: Boogie Preprocessor took 21.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:12:49,886 INFO L168 Benchmark]: RCFGBuilder took 346.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 12:12:49,886 INFO L168 Benchmark]: TraceAbstraction took 247747.80 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -28.3 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -254.9 kB). Peak memory consumption was 549.7 MB. Max. memory is 7.1 GB. [2018-10-02 12:12:49,890 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 346.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247747.80 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -28.3 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -254.9 kB). Peak memory consumption was 549.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 56]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 56). Cancelled while BasicCegarLoop was analyzing trace of length 347 with TraceHistMax 86, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 345 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 247.6s OverallTime, 86 OverallIterations, 86 TraceHistogramMax, 72.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 510 SDtfs, 6644 SDslu, 9184 SDs, 0 SdLazy, 9354 SolverSat, 6895 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18440 GetRequests, 14785 SyntacticMatches, 0 SemanticMatches, 3655 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 84.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 85 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.4s SsaConstructionTime, 75.5s SatisfiabilityAnalysisTime, 90.5s InterpolantComputationTime, 29574 NumberOfCodeBlocks, 29574 NumberOfCodeBlocksAsserted, 2031 NumberOfCheckSat, 29405 ConstructedInterpolants, 0 QuantifiedInterpolants, 13421285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 44268 ConjunctsInSsa, 3738 ConjunctsInUnsatCore, 169 InterpolantComputations, 1 PerfectInterpolantSequences, 409360/818720 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/array3.i_4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-12-49-900.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/array3.i_4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-12-49-900.csv Completed graceful shutdown