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.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:26:12,561 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:26:12,563 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:26:12,576 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:26:12,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:26:12,578 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:26:12,579 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:26:12,581 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:26:12,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:26:12,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:26:12,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:26:12,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:26:12,585 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:26:12,586 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:26:12,590 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:26:12,591 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:26:12,592 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:26:12,595 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:26:12,602 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:26:12,606 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:26:12,607 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:26:12,611 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:26:12,616 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:26:12,616 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:26:12,616 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:26:12,617 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:26:12,618 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:26:12,620 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:26:12,621 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:26:12,623 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:26:12,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:26:12,625 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:26:12,625 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:26:12,625 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:26:12,628 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:26:12,628 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:26:12,630 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 20:26:12,648 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:26:12,648 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:26:12,649 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:26:12,649 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:26:12,650 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:26:12,650 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:26:12,650 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:26:12,651 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:26:12,651 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:26:12,651 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:26:12,651 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:26:12,651 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:26:12,652 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:26:12,652 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:26:12,652 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:26:12,652 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:26:12,652 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:26:12,652 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:26:12,653 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:26:12,653 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:26:12,653 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:26:12,653 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:26:12,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:26:12,654 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:26:12,654 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:26:12,654 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:26:12,654 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:26:12,654 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:26:12,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:26:12,655 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:26:12,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:26:12,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:26:12,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:26:12,734 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:26:12,735 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:26:12,736 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2018-09-30 20:26:12,737 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2018-09-30 20:26:12,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:26:12,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:26:12,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:26:12,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:26:12,819 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:26:12,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:12" (1/1) ... [2018-09-30 20:26:12,858 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:12" (1/1) ... [2018-09-30 20:26:12,866 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:26:12,866 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:26:12,866 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:26:12,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:26:12,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:26:12,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:26:12,886 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:26:12,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:12" (1/1) ... [2018-09-30 20:26:12,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:12" (1/1) ... [2018-09-30 20:26:12,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:12" (1/1) ... [2018-09-30 20:26:12,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:12" (1/1) ... [2018-09-30 20:26:12,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:12" (1/1) ... [2018-09-30 20:26:12,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:12" (1/1) ... [2018-09-30 20:26:12,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:12" (1/1) ... [2018-09-30 20:26:12,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:26:12,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:26:12,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:26:12,919 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:26:12,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:12" (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-09-30 20:26:12,999 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-30 20:26:13,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-30 20:26:13,000 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-30 20:26:13,259 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:26:13,260 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:26:13 BoogieIcfgContainer [2018-09-30 20:26:13,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:26:13,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:26:13,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:26:13,265 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:26:13,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:12" (1/2) ... [2018-09-30 20:26:13,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ac6d10 and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:26:13, skipping insertion in model container [2018-09-30 20:26:13,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:26:13" (2/2) ... [2018-09-30 20:26:13,268 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2018-09-30 20:26:13,279 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:26:13,287 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:26:13,350 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:26:13,351 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:26:13,352 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:26:13,352 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:26:13,352 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:26:13,353 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:26:13,353 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:26:13,353 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:26:13,353 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:26:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-30 20:26:13,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 20:26:13,381 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:13,388 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 20:26:13,390 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:13,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:13,404 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-30 20:26:13,406 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:13,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:13,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:13,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:13,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:13,622 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:26:13,623 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-30 20:26:13,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:26:13,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:26:13,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:26:13,641 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-09-30 20:26:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:13,716 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-30 20:26:13,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:26:13,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-30 20:26:13,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:13,737 INFO L225 Difference]: With dead ends: 17 [2018-09-30 20:26:13,740 INFO L226 Difference]: Without dead ends: 10 [2018-09-30 20:26:13,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:26:13,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-30 20:26:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-09-30 20:26:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 20:26:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-30 20:26:13,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-09-30 20:26:13,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:13,798 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-30 20:26:13,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:26:13,798 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-30 20:26:13,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:26:13,799 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:13,799 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-30 20:26:13,800 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:13,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:13,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-09-30 20:26:13,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:13,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:13,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:13,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:13,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:13,894 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:13,894 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-09-30 20:26:13,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:13,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:13,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:13,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:14,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:14,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:14,133 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:14,133 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2018-09-30 20:26:14,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:26:14,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:26:14,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-30 20:26:14,135 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-09-30 20:26:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:14,217 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-30 20:26:14,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:26:14,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-09-30 20:26:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:14,219 INFO L225 Difference]: With dead ends: 15 [2018-09-30 20:26:14,219 INFO L226 Difference]: Without dead ends: 14 [2018-09-30 20:26:14,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-30 20:26:14,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-30 20:26:14,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-09-30 20:26:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 20:26:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-30 20:26:14,225 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-09-30 20:26:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:14,225 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-30 20:26:14,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:26:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-30 20:26:14,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:26:14,226 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:14,226 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-09-30 20:26:14,227 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:14,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:14,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-09-30 20:26:14,227 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:14,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:14,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:14,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:14,383 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:14,383 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-09-30 20:26:14,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:14,445 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:14,445 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:14,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:14,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:14,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:14,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:14,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:14,724 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:14,724 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-09-30 20:26:14,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:26:14,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:26:14,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:26:14,726 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-09-30 20:26:14,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:14,797 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-30 20:26:14,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:26:14,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:26:14,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:14,800 INFO L225 Difference]: With dead ends: 19 [2018-09-30 20:26:14,800 INFO L226 Difference]: Without dead ends: 18 [2018-09-30 20:26:14,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:26:14,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-30 20:26:14,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-30 20:26:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-30 20:26:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-30 20:26:14,806 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-09-30 20:26:14,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:14,806 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-30 20:26:14,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:26:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-30 20:26:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:26:14,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:14,808 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-09-30 20:26:14,808 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:14,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:14,809 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-09-30 20:26:14,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:14,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:14,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:14,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:14,951 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:14,951 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-09-30 20:26:14,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:15,029 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-30 20:26:15,030 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:15,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:15,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:15,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:15,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:15,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:15,231 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:15,256 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:15,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-30 20:26:15,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:26:15,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:26:15,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-30 20:26:15,259 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-30 20:26:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:15,345 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-30 20:26:15,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:26:15,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-30 20:26:15,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:15,347 INFO L225 Difference]: With dead ends: 23 [2018-09-30 20:26:15,348 INFO L226 Difference]: Without dead ends: 22 [2018-09-30 20:26:15,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-30 20:26:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-30 20:26:15,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-09-30 20:26:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-30 20:26:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-30 20:26:15,356 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-09-30 20:26:15,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:15,356 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-30 20:26:15,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:26:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-30 20:26:15,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 20:26:15,357 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:15,357 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-09-30 20:26:15,358 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:15,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:15,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-09-30 20:26:15,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:15,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:15,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:15,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:15,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:15,478 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:15,478 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-09-30 20:26:15,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:15,505 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:15,506 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:15,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:15,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:15,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:15,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:15,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:16,027 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:16,027 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-30 20:26:16,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 20:26:16,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 20:26:16,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-30 20:26:16,029 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-30 20:26:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:16,085 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-30 20:26:16,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:26:16,086 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-30 20:26:16,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:16,087 INFO L225 Difference]: With dead ends: 27 [2018-09-30 20:26:16,087 INFO L226 Difference]: Without dead ends: 26 [2018-09-30 20:26:16,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-30 20:26:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-30 20:26:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-09-30 20:26:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-30 20:26:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-30 20:26:16,094 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-09-30 20:26:16,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:16,095 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-30 20:26:16,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 20:26:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-30 20:26:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 20:26:16,096 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:16,096 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-09-30 20:26:16,096 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:16,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:16,097 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-09-30 20:26:16,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:16,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:16,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:16,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:16,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:16,271 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:16,272 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-09-30 20:26:16,284 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:16,304 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-30 20:26:16,305 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:16,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:16,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:16,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:16,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:16,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:16,447 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:16,468 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:16,468 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-30 20:26:16,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:26:16,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:26:16,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:26:16,470 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-09-30 20:26:16,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:16,529 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-30 20:26:16,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:26:16,534 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-30 20:26:16,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:16,535 INFO L225 Difference]: With dead ends: 31 [2018-09-30 20:26:16,535 INFO L226 Difference]: Without dead ends: 30 [2018-09-30 20:26:16,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:26:16,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-30 20:26:16,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-09-30 20:26:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-30 20:26:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-30 20:26:16,541 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-09-30 20:26:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:16,542 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-30 20:26:16,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:26:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-30 20:26:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 20:26:16,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:16,543 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-09-30 20:26:16,544 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:16,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:16,544 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-09-30 20:26:16,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:16,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:16,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:16,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:16,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:16,835 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:16,835 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-09-30 20:26:16,846 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:16,870 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-30 20:26:16,870 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:16,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:16,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:16,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:16,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:16,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:17,121 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:17,122 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 20:26:17,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:26:17,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:26:17,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:26:17,123 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-09-30 20:26:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:17,211 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-30 20:26:17,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:26:17,212 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-30 20:26:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:17,214 INFO L225 Difference]: With dead ends: 35 [2018-09-30 20:26:17,214 INFO L226 Difference]: Without dead ends: 34 [2018-09-30 20:26:17,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:26:17,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-30 20:26:17,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-30 20:26:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-30 20:26:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-30 20:26:17,220 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-09-30 20:26:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:17,220 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-30 20:26:17,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:26:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-30 20:26:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-30 20:26:17,221 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:17,222 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-09-30 20:26:17,222 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:17,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:17,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-09-30 20:26:17,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:17,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:17,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:17,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:17,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:17,370 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:17,370 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:17,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:17,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:17,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:17,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:17,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:17,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:17,618 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:17,648 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:17,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-30 20:26:17,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 20:26:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 20:26:17,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:26:17,650 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-09-30 20:26:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:17,873 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-30 20:26:17,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:26:17,874 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-09-30 20:26:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:17,875 INFO L225 Difference]: With dead ends: 39 [2018-09-30 20:26:17,876 INFO L226 Difference]: Without dead ends: 38 [2018-09-30 20:26:17,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:26:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-30 20:26:17,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-09-30 20:26:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 20:26:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-30 20:26:17,882 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-09-30 20:26:17,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:17,883 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-30 20:26:17,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 20:26:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-30 20:26:17,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 20:26:17,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:17,884 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-09-30 20:26:17,884 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:17,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:17,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-09-30 20:26:17,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:17,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:17,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:17,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:17,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:18,127 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:18,127 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-09-30 20:26:18,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:18,156 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:18,156 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:18,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:18,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:18,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:18,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:18,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:18,485 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:18,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-30 20:26:18,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 20:26:18,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 20:26:18,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-30 20:26:18,487 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-09-30 20:26:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:18,630 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-30 20:26:18,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:26:18,630 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-09-30 20:26:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:18,632 INFO L225 Difference]: With dead ends: 43 [2018-09-30 20:26:18,632 INFO L226 Difference]: Without dead ends: 42 [2018-09-30 20:26:18,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-30 20:26:18,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-30 20:26:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-09-30 20:26:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-30 20:26:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-30 20:26:18,640 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-09-30 20:26:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:18,640 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-30 20:26:18,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 20:26:18,640 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-30 20:26:18,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-30 20:26:18,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:18,641 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-09-30 20:26:18,642 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:18,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:18,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-09-30 20:26:18,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:18,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:18,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:18,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:18,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:18,823 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:18,823 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-09-30 20:26:18,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:18,856 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-30 20:26:18,856 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:18,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:18,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:18,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:18,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:18,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:19,073 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:19,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-30 20:26:19,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 20:26:19,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 20:26:19,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:26:19,075 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-09-30 20:26:19,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:19,288 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-30 20:26:19,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:26:19,288 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-09-30 20:26:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:19,290 INFO L225 Difference]: With dead ends: 47 [2018-09-30 20:26:19,290 INFO L226 Difference]: Without dead ends: 46 [2018-09-30 20:26:19,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:26:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-30 20:26:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-09-30 20:26:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-30 20:26:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-30 20:26:19,297 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-09-30 20:26:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:19,297 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-30 20:26:19,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 20:26:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-30 20:26:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-30 20:26:19,299 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:19,299 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-09-30 20:26:19,299 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:19,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:19,300 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-09-30 20:26:19,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:19,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:19,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:19,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:19,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:20,116 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:20,116 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-09-30 20:26:20,128 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:20,175 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:20,176 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:20,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:20,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:20,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:20,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:20,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:20,864 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:20,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-09-30 20:26:20,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-30 20:26:20,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-30 20:26:20,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-30 20:26:20,865 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-09-30 20:26:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:20,991 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-30 20:26:20,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:26:20,992 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-30 20:26:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:20,993 INFO L225 Difference]: With dead ends: 51 [2018-09-30 20:26:20,994 INFO L226 Difference]: Without dead ends: 50 [2018-09-30 20:26:20,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-30 20:26:20,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-30 20:26:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-09-30 20:26:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-30 20:26:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-30 20:26:20,999 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-09-30 20:26:21,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:21,000 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-30 20:26:21,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-30 20:26:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-30 20:26:21,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-30 20:26:21,001 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:21,001 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-09-30 20:26:21,001 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:21,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-09-30 20:26:21,002 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:21,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:21,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:21,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:21,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:21,234 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:21,234 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-09-30 20:26:21,245 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:21,325 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-30 20:26:21,325 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:21,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:21,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:21,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:21,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:21,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:21,693 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:21,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-09-30 20:26:21,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-30 20:26:21,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-30 20:26:21,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-30 20:26:21,695 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-09-30 20:26:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:21,789 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-30 20:26:21,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:26:21,789 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-09-30 20:26:21,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:21,790 INFO L225 Difference]: With dead ends: 55 [2018-09-30 20:26:21,790 INFO L226 Difference]: Without dead ends: 54 [2018-09-30 20:26:21,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-30 20:26:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-30 20:26:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-30 20:26:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-30 20:26:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-30 20:26:21,797 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-09-30 20:26:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:21,797 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-30 20:26:21,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-30 20:26:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-30 20:26:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-30 20:26:21,798 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:21,799 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-09-30 20:26:21,799 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:21,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-09-30 20:26:21,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:21,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:21,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:21,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:21,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:22,347 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:22,347 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-09-30 20:26:22,355 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:22,414 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-30 20:26:22,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:22,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:22,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:22,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:22,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:22,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:22,694 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:22,715 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:22,716 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-09-30 20:26:22,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-30 20:26:22,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-30 20:26:22,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-30 20:26:22,718 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-09-30 20:26:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:22,836 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-30 20:26:22,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:26:22,837 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-09-30 20:26:22,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:22,838 INFO L225 Difference]: With dead ends: 59 [2018-09-30 20:26:22,838 INFO L226 Difference]: Without dead ends: 58 [2018-09-30 20:26:22,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-30 20:26:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-30 20:26:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-09-30 20:26:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-30 20:26:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-30 20:26:22,845 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-09-30 20:26:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:22,846 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-30 20:26:22,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-30 20:26:22,846 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-30 20:26:22,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-30 20:26:22,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:22,847 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-09-30 20:26:22,847 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:22,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:22,847 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-09-30 20:26:22,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:22,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:22,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:22,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:23,086 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:23,086 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-09-30 20:26:23,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:23,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:23,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:23,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:23,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:23,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:23,550 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:23,550 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-30 20:26:23,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-30 20:26:23,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-30 20:26:23,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-30 20:26:23,551 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-09-30 20:26:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:23,733 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-30 20:26:23,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:26:23,733 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-09-30 20:26:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:23,735 INFO L225 Difference]: With dead ends: 63 [2018-09-30 20:26:23,735 INFO L226 Difference]: Without dead ends: 62 [2018-09-30 20:26:23,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-30 20:26:23,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-30 20:26:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-09-30 20:26:23,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-30 20:26:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-30 20:26:23,741 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-09-30 20:26:23,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:23,742 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-30 20:26:23,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-30 20:26:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-30 20:26:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-30 20:26:23,743 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:23,743 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-09-30 20:26:23,743 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:23,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:23,744 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-09-30 20:26:23,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:23,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:23,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:23,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:23,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:24,071 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:24,071 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-09-30 20:26:24,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:24,100 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:24,100 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:24,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:24,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:24,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:24,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:24,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:24,446 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:24,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-09-30 20:26:24,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-30 20:26:24,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-30 20:26:24,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-30 20:26:24,448 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-09-30 20:26:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:24,574 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-30 20:26:24,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:26:24,575 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-09-30 20:26:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:24,576 INFO L225 Difference]: With dead ends: 67 [2018-09-30 20:26:24,576 INFO L226 Difference]: Without dead ends: 66 [2018-09-30 20:26:24,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-30 20:26:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-30 20:26:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-09-30 20:26:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-30 20:26:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-30 20:26:24,583 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-09-30 20:26:24,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:24,583 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-30 20:26:24,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-30 20:26:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-30 20:26:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-30 20:26:24,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:24,584 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-09-30 20:26:24,585 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:24,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:24,585 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-09-30 20:26:24,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:24,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:24,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:24,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:24,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:24,817 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:24,817 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-09-30 20:26:24,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:24,861 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-30 20:26:24,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:24,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:24,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:24,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:24,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:24,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:25,175 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:25,175 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-09-30 20:26:25,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-30 20:26:25,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-30 20:26:25,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 20:26:25,176 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-09-30 20:26:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:25,310 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-30 20:26:25,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:26:25,310 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-09-30 20:26:25,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:25,311 INFO L225 Difference]: With dead ends: 71 [2018-09-30 20:26:25,312 INFO L226 Difference]: Without dead ends: 70 [2018-09-30 20:26:25,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 20:26:25,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-30 20:26:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-09-30 20:26:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-30 20:26:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-30 20:26:25,319 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-09-30 20:26:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:25,319 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-30 20:26:25,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-30 20:26:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-30 20:26:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-30 20:26:25,320 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:25,320 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-09-30 20:26:25,321 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:25,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:25,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-09-30 20:26:25,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:25,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:25,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:25,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:25,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:25,866 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:25,866 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-09-30 20:26:25,876 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:25,895 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:25,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:25,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:25,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:25,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:25,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:25,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:26,426 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:26,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-09-30 20:26:26,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-30 20:26:26,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-30 20:26:26,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 20:26:26,427 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-09-30 20:26:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:26,547 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-30 20:26:26,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 20:26:26,547 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-09-30 20:26:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:26,548 INFO L225 Difference]: With dead ends: 75 [2018-09-30 20:26:26,548 INFO L226 Difference]: Without dead ends: 74 [2018-09-30 20:26:26,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 20:26:26,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-30 20:26:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-09-30 20:26:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 20:26:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-30 20:26:26,554 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-09-30 20:26:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:26,555 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-30 20:26:26,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-30 20:26:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-30 20:26:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-30 20:26:26,556 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:26,556 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-09-30 20:26:26,556 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:26,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:26,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-09-30 20:26:26,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:26,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:26,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:26,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:26,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:26,947 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:26,947 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-09-30 20:26:26,955 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:26,992 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-30 20:26:26,992 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:26,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:26,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:26,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:27,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:27,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:27,359 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:27,359 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-09-30 20:26:27,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-30 20:26:27,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-30 20:26:27,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 20:26:27,360 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-09-30 20:26:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:27,460 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-30 20:26:27,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 20:26:27,461 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-09-30 20:26:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:27,462 INFO L225 Difference]: With dead ends: 79 [2018-09-30 20:26:27,462 INFO L226 Difference]: Without dead ends: 78 [2018-09-30 20:26:27,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 20:26:27,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-30 20:26:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-09-30 20:26:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-30 20:26:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-30 20:26:27,468 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-09-30 20:26:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:27,468 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-30 20:26:27,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-30 20:26:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-30 20:26:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-30 20:26:27,470 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:27,470 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-09-30 20:26:27,470 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:27,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:27,470 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-09-30 20:26:27,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:27,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:27,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:27,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:27,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:27,877 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:27,877 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-09-30 20:26:27,884 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:27,928 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-30 20:26:27,928 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:27,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:27,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:27,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:27,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:27,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:28,562 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:28,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-09-30 20:26:28,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-30 20:26:28,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-30 20:26:28,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 20:26:28,564 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-09-30 20:26:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:28,676 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-30 20:26:28,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:26:28,676 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-09-30 20:26:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:28,677 INFO L225 Difference]: With dead ends: 83 [2018-09-30 20:26:28,678 INFO L226 Difference]: Without dead ends: 82 [2018-09-30 20:26:28,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 20:26:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-30 20:26:28,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-09-30 20:26:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-30 20:26:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-30 20:26:28,683 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-09-30 20:26:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:28,683 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-30 20:26:28,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-30 20:26:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-30 20:26:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-30 20:26:28,684 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:28,684 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-09-30 20:26:28,684 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:28,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-09-30 20:26:28,685 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:28,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:28,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:28,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:28,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:29,311 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:29,311 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-09-30 20:26:29,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:29,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:29,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:29,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:29,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:29,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:30,211 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:30,212 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-09-30 20:26:30,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-30 20:26:30,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-30 20:26:30,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 20:26:30,213 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-09-30 20:26:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:30,368 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-30 20:26:30,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 20:26:30,368 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-30 20:26:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:30,369 INFO L225 Difference]: With dead ends: 87 [2018-09-30 20:26:30,369 INFO L226 Difference]: Without dead ends: 86 [2018-09-30 20:26:30,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 20:26:30,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-30 20:26:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-09-30 20:26:30,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-30 20:26:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-30 20:26:30,375 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-09-30 20:26:30,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:30,375 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-30 20:26:30,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-30 20:26:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-30 20:26:30,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-30 20:26:30,376 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:30,376 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-09-30 20:26:30,376 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:30,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:30,377 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-09-30 20:26:30,377 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:30,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:30,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:30,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:30,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:31,264 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:31,264 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-09-30 20:26:31,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:31,299 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:31,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:31,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:31,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:31,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:31,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:31,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:31,714 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:31,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-09-30 20:26:31,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-30 20:26:31,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-30 20:26:31,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-30 20:26:31,715 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-09-30 20:26:31,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:31,877 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-30 20:26:31,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:26:31,878 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-09-30 20:26:31,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:31,879 INFO L225 Difference]: With dead ends: 91 [2018-09-30 20:26:31,879 INFO L226 Difference]: Without dead ends: 90 [2018-09-30 20:26:31,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-30 20:26:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-30 20:26:31,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-09-30 20:26:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-30 20:26:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-30 20:26:31,884 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-09-30 20:26:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:31,885 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-30 20:26:31,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-30 20:26:31,885 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-30 20:26:31,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-30 20:26:31,886 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:31,886 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-09-30 20:26:31,886 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:31,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:31,886 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-09-30 20:26:31,887 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:31,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:31,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:31,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:31,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:32,525 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:32,525 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-09-30 20:26:32,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:32,584 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-30 20:26:32,585 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:32,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:32,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:32,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:32,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:32,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:34,793 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:34,794 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-09-30 20:26:34,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-30 20:26:34,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-30 20:26:34,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 20:26:34,795 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-09-30 20:26:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:34,953 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-30 20:26:34,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:26:34,954 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-09-30 20:26:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:34,955 INFO L225 Difference]: With dead ends: 95 [2018-09-30 20:26:34,955 INFO L226 Difference]: Without dead ends: 94 [2018-09-30 20:26:34,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 20:26:34,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-30 20:26:34,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-09-30 20:26:34,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 20:26:34,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-30 20:26:34,961 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-09-30 20:26:34,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:34,961 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-30 20:26:34,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-30 20:26:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-30 20:26:34,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-30 20:26:34,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:34,962 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-09-30 20:26:34,962 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:34,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:34,963 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-09-30 20:26:34,963 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:34,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:34,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:34,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:34,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:35,385 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:35,385 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-09-30 20:26:35,393 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:35,430 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:35,430 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:35,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:35,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:35,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:35,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:35,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:36,111 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:36,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:36,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-09-30 20:26:36,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-30 20:26:36,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-30 20:26:36,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 20:26:36,134 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-09-30 20:26:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:36,288 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-30 20:26:36,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:26:36,289 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-09-30 20:26:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:36,290 INFO L225 Difference]: With dead ends: 99 [2018-09-30 20:26:36,290 INFO L226 Difference]: Without dead ends: 98 [2018-09-30 20:26:36,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 20:26:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-30 20:26:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-09-30 20:26:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-30 20:26:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-30 20:26:36,295 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-09-30 20:26:36,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:36,296 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-30 20:26:36,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-30 20:26:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-30 20:26:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-30 20:26:36,297 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:36,297 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-09-30 20:26:36,297 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:36,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:36,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-09-30 20:26:36,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:36,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:36,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:36,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:36,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:36,778 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:36,778 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-09-30 20:26:36,786 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:36,836 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-30 20:26:36,837 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:36,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:36,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:36,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:36,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:36,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:37,408 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:37,408 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-09-30 20:26:37,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 20:26:37,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 20:26:37,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 20:26:37,410 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-09-30 20:26:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:37,686 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-30 20:26:37,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 20:26:37,687 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-30 20:26:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:37,688 INFO L225 Difference]: With dead ends: 103 [2018-09-30 20:26:37,688 INFO L226 Difference]: Without dead ends: 102 [2018-09-30 20:26:37,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 20:26:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-30 20:26:37,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-09-30 20:26:37,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-30 20:26:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-30 20:26:37,695 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-09-30 20:26:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:37,695 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-30 20:26:37,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 20:26:37,695 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-30 20:26:37,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-30 20:26:37,696 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:37,696 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-09-30 20:26:37,697 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:37,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:37,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-09-30 20:26:37,697 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:37,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:37,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:37,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:37,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:38,286 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:38,286 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-09-30 20:26:38,294 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:38,355 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-30 20:26:38,356 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:38,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:38,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:38,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:38,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:38,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:38,859 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:38,859 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-09-30 20:26:38,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-30 20:26:38,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-30 20:26:38,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 20:26:38,861 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-09-30 20:26:39,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:39,056 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-30 20:26:39,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 20:26:39,057 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-09-30 20:26:39,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:39,058 INFO L225 Difference]: With dead ends: 107 [2018-09-30 20:26:39,059 INFO L226 Difference]: Without dead ends: 106 [2018-09-30 20:26:39,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 20:26:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-30 20:26:39,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-09-30 20:26:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-30 20:26:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-30 20:26:39,064 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-09-30 20:26:39,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:39,064 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-30 20:26:39,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-30 20:26:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-30 20:26:39,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-30 20:26:39,065 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:39,065 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-09-30 20:26:39,065 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:39,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:39,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-09-30 20:26:39,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:39,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:39,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:39,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:39,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:39,655 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:39,655 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-09-30 20:26:39,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:39,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:39,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:39,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:39,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:39,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:40,447 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:40,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-09-30 20:26:40,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-30 20:26:40,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-30 20:26:40,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-30 20:26:40,449 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-09-30 20:26:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:40,624 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-30 20:26:40,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:26:40,624 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-09-30 20:26:40,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:40,625 INFO L225 Difference]: With dead ends: 111 [2018-09-30 20:26:40,625 INFO L226 Difference]: Without dead ends: 110 [2018-09-30 20:26:40,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-30 20:26:40,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-30 20:26:40,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-09-30 20:26:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 20:26:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-30 20:26:40,631 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-09-30 20:26:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:40,631 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-30 20:26:40,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-30 20:26:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-30 20:26:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-30 20:26:40,631 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:40,632 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-09-30 20:26:40,632 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:40,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:40,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-09-30 20:26:40,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:40,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:40,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:40,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:40,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:41,333 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:41,334 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-09-30 20:26:41,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:41,373 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:41,373 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:41,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:41,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:41,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:41,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:41,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:41,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:41,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-09-30 20:26:41,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-30 20:26:41,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-30 20:26:41,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 20:26:41,938 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-09-30 20:26:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:42,133 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-30 20:26:42,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 20:26:42,133 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-09-30 20:26:42,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:42,134 INFO L225 Difference]: With dead ends: 115 [2018-09-30 20:26:42,135 INFO L226 Difference]: Without dead ends: 114 [2018-09-30 20:26:42,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 20:26:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-30 20:26:42,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-09-30 20:26:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-30 20:26:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-30 20:26:42,140 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-09-30 20:26:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:42,140 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-30 20:26:42,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-30 20:26:42,141 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-30 20:26:42,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-30 20:26:42,141 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:42,141 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-09-30 20:26:42,142 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:42,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:42,142 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-09-30 20:26:42,142 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:42,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:42,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:42,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:42,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:42,734 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:42,734 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-09-30 20:26:42,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:42,827 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-30 20:26:42,827 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:42,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:42,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:42,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:42,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:42,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:43,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:43,425 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:43,425 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-09-30 20:26:43,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-30 20:26:43,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-30 20:26:43,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 20:26:43,427 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-09-30 20:26:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:43,622 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-30 20:26:43,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 20:26:43,622 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-30 20:26:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:43,624 INFO L225 Difference]: With dead ends: 119 [2018-09-30 20:26:43,624 INFO L226 Difference]: Without dead ends: 118 [2018-09-30 20:26:43,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 20:26:43,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-30 20:26:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-09-30 20:26:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-30 20:26:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-30 20:26:43,630 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-09-30 20:26:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:43,630 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-30 20:26:43,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-30 20:26:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-30 20:26:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-30 20:26:43,631 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:43,631 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-09-30 20:26:43,631 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:43,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-09-30 20:26:43,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:43,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:43,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:43,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:43,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:44,190 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:44,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 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-09-30 20:26:44,198 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:44,232 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:44,232 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:44,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:44,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:44,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:44,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:44,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:44,926 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:44,927 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-09-30 20:26:44,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-30 20:26:44,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-30 20:26:44,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-30 20:26:44,928 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-09-30 20:26:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:45,103 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-30 20:26:45,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 20:26:45,103 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-09-30 20:26:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:45,105 INFO L225 Difference]: With dead ends: 123 [2018-09-30 20:26:45,105 INFO L226 Difference]: Without dead ends: 122 [2018-09-30 20:26:45,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-30 20:26:45,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-30 20:26:45,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-09-30 20:26:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-30 20:26:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-30 20:26:45,111 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-09-30 20:26:45,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:45,111 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-30 20:26:45,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-30 20:26:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-30 20:26:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-30 20:26:45,112 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:45,112 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-09-30 20:26:45,112 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:45,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:45,113 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-09-30 20:26:45,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:45,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:45,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:45,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:45,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:45,790 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:45,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 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-09-30 20:26:45,798 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:45,863 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-30 20:26:45,863 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:45,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:45,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:45,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:45,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:45,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:46,816 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:46,817 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-09-30 20:26:46,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-30 20:26:46,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-30 20:26:46,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 20:26:46,818 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-09-30 20:26:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:47,079 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-30 20:26:47,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 20:26:47,079 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-09-30 20:26:47,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:47,081 INFO L225 Difference]: With dead ends: 127 [2018-09-30 20:26:47,081 INFO L226 Difference]: Without dead ends: 126 [2018-09-30 20:26:47,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 20:26:47,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-30 20:26:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-09-30 20:26:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-30 20:26:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-30 20:26:47,087 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-09-30 20:26:47,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:47,087 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-30 20:26:47,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-30 20:26:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-30 20:26:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-30 20:26:47,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:47,088 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-09-30 20:26:47,088 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:47,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:47,088 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-09-30 20:26:47,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:47,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:47,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:47,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:47,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:48,394 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:48,394 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-09-30 20:26:48,402 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:48,481 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-30 20:26:48,481 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:48,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:48,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:48,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:48,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:48,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:49,158 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:49,158 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-09-30 20:26:49,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-30 20:26:49,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-30 20:26:49,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 20:26:49,159 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-09-30 20:26:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:49,356 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-30 20:26:49,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 20:26:49,356 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-09-30 20:26:49,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:49,357 INFO L225 Difference]: With dead ends: 131 [2018-09-30 20:26:49,357 INFO L226 Difference]: Without dead ends: 130 [2018-09-30 20:26:49,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 20:26:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-30 20:26:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-09-30 20:26:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-30 20:26:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-30 20:26:49,362 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-09-30 20:26:49,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:49,362 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-30 20:26:49,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-30 20:26:49,363 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-30 20:26:49,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-30 20:26:49,363 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:49,363 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-09-30 20:26:49,363 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:49,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:49,364 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-09-30 20:26:49,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:49,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:49,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:49,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:49,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:50,004 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:50,004 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) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:50,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:50,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:50,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:50,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:50,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:50,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:50,814 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:50,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-09-30 20:26:50,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-30 20:26:50,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-30 20:26:50,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 20:26:50,816 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-09-30 20:26:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:51,022 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-30 20:26:51,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 20:26:51,022 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-09-30 20:26:51,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:51,023 INFO L225 Difference]: With dead ends: 135 [2018-09-30 20:26:51,023 INFO L226 Difference]: Without dead ends: 134 [2018-09-30 20:26:51,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 20:26:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-30 20:26:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-09-30 20:26:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-30 20:26:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-30 20:26:51,028 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-09-30 20:26:51,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:51,028 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-30 20:26:51,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-30 20:26:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-30 20:26:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-30 20:26:51,029 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:51,029 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-09-30 20:26:51,030 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:51,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:51,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-09-30 20:26:51,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:51,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:51,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:51,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:51,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:51,864 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:51,865 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-09-30 20:26:51,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:51,910 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:51,910 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:51,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:51,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:51,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:51,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:51,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:52,852 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:52,852 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-09-30 20:26:52,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-30 20:26:52,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-30 20:26:52,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 20:26:52,854 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-09-30 20:26:53,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:53,080 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-30 20:26:53,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-30 20:26:53,081 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-30 20:26:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:53,083 INFO L225 Difference]: With dead ends: 139 [2018-09-30 20:26:53,083 INFO L226 Difference]: Without dead ends: 138 [2018-09-30 20:26:53,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 20:26:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-30 20:26:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-09-30 20:26:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-30 20:26:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-30 20:26:53,088 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-09-30 20:26:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:53,089 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-30 20:26:53,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-30 20:26:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-30 20:26:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-30 20:26:53,089 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:53,090 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-09-30 20:26:53,090 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:53,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:53,090 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-09-30 20:26:53,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:53,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:53,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:53,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:53,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:53,770 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:53,770 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-09-30 20:26:53,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:53,951 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-30 20:26:53,951 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:53,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:53,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:53,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:54,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:54,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:55,809 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:55,809 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-09-30 20:26:55,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-30 20:26:55,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-30 20:26:55,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 20:26:55,811 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-09-30 20:26:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:56,134 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-30 20:26:56,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-30 20:26:56,135 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-09-30 20:26:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:56,136 INFO L225 Difference]: With dead ends: 143 [2018-09-30 20:26:56,136 INFO L226 Difference]: Without dead ends: 142 [2018-09-30 20:26:56,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 20:26:56,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-30 20:26:56,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-09-30 20:26:56,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-30 20:26:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-30 20:26:56,141 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-09-30 20:26:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:56,142 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-30 20:26:56,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-30 20:26:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-30 20:26:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-30 20:26:56,143 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:56,143 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-09-30 20:26:56,143 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:56,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:56,143 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-09-30 20:26:56,143 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:56,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:56,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:56,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:56,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:57,650 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:57,650 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-09-30 20:26:57,657 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:57,696 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:57,697 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:57,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:57,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:57,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:57,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:57,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:58,684 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:58,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-09-30 20:26:58,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-30 20:26:58,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-30 20:26:58,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-30 20:26:58,685 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-09-30 20:26:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:59,120 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-30 20:26:59,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 20:26:59,120 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-09-30 20:26:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:59,121 INFO L225 Difference]: With dead ends: 147 [2018-09-30 20:26:59,122 INFO L226 Difference]: Without dead ends: 146 [2018-09-30 20:26:59,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-30 20:26:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-30 20:26:59,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-09-30 20:26:59,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-30 20:26:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-30 20:26:59,127 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-09-30 20:26:59,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:59,127 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-30 20:26:59,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-30 20:26:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-30 20:26:59,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-30 20:26:59,128 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:59,129 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-09-30 20:26:59,129 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:59,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:59,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-09-30 20:26:59,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:59,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:59,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:59,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:59,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:00,114 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:00,115 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-09-30 20:27:00,123 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:27:00,204 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-30 20:27:00,204 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:00,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:00,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:00,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:00,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:00,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:01,130 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:01,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-09-30 20:27:01,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-30 20:27:01,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-30 20:27:01,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 20:27:01,132 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-09-30 20:27:01,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:01,602 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-30 20:27:01,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 20:27:01,602 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-09-30 20:27:01,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:01,603 INFO L225 Difference]: With dead ends: 151 [2018-09-30 20:27:01,603 INFO L226 Difference]: Without dead ends: 150 [2018-09-30 20:27:01,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 20:27:01,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-30 20:27:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-09-30 20:27:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-30 20:27:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-30 20:27:01,609 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-09-30 20:27:01,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:01,609 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-30 20:27:01,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-30 20:27:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-30 20:27:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-30 20:27:01,610 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:01,610 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-09-30 20:27:01,610 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:01,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:01,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-09-30 20:27:01,611 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:01,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:01,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:01,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:01,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:02,424 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:02,424 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-09-30 20:27:02,431 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:27:02,921 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-30 20:27:02,922 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:02,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:02,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:02,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:02,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:02,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:03,904 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:03,905 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-09-30 20:27:03,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-30 20:27:03,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-30 20:27:03,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-30 20:27:03,906 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-09-30 20:27:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:04,190 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-30 20:27:04,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 20:27:04,191 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-09-30 20:27:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:04,192 INFO L225 Difference]: With dead ends: 155 [2018-09-30 20:27:04,192 INFO L226 Difference]: Without dead ends: 154 [2018-09-30 20:27:04,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-30 20:27:04,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-30 20:27:04,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-09-30 20:27:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-30 20:27:04,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-30 20:27:04,199 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-09-30 20:27:04,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:04,200 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-30 20:27:04,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-30 20:27:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-30 20:27:04,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-30 20:27:04,201 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:04,201 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-09-30 20:27:04,201 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:04,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:04,202 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-09-30 20:27:04,202 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:04,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:04,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:04,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:04,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:05,061 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:05,062 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-09-30 20:27:05,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:05,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:05,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:05,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:05,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:05,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:06,678 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:06,679 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-09-30 20:27:06,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-30 20:27:06,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-30 20:27:06,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 20:27:06,680 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-09-30 20:27:06,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:06,959 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-30 20:27:06,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 20:27:06,959 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-09-30 20:27:06,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:06,961 INFO L225 Difference]: With dead ends: 159 [2018-09-30 20:27:06,961 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 20:27:06,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 20:27:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 20:27:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-09-30 20:27:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-30 20:27:06,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-30 20:27:06,965 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-09-30 20:27:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:06,966 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-30 20:27:06,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-30 20:27:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-30 20:27:06,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-30 20:27:06,966 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:06,966 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-09-30 20:27:06,967 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:06,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:06,967 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-09-30 20:27:06,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:06,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:06,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:06,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:06,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:07,931 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:07,931 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-09-30 20:27:07,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:27:07,980 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:27:07,980 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:07,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:07,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:07,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:07,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:07,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:09,093 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:09,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-09-30 20:27:09,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-30 20:27:09,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-30 20:27:09,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-30 20:27:09,095 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-09-30 20:27:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:09,393 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-30 20:27:09,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 20:27:09,394 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-09-30 20:27:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:09,395 INFO L225 Difference]: With dead ends: 163 [2018-09-30 20:27:09,396 INFO L226 Difference]: Without dead ends: 162 [2018-09-30 20:27:09,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-30 20:27:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-30 20:27:09,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-09-30 20:27:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-30 20:27:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-30 20:27:09,402 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-09-30 20:27:09,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:09,402 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-30 20:27:09,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-30 20:27:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-30 20:27:09,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-30 20:27:09,403 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:09,403 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-09-30 20:27:09,403 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:09,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:09,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-09-30 20:27:09,404 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:09,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:09,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:09,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:09,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:11,034 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:11,034 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-09-30 20:27:11,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:27:11,189 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-30 20:27:11,189 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:11,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:11,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:11,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:11,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:11,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:12,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:12,467 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:12,467 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-09-30 20:27:12,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-30 20:27:12,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-30 20:27:12,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 20:27:12,468 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-09-30 20:27:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:12,738 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-30 20:27:12,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 20:27:12,738 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-09-30 20:27:12,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:12,740 INFO L225 Difference]: With dead ends: 167 [2018-09-30 20:27:12,740 INFO L226 Difference]: Without dead ends: 166 [2018-09-30 20:27:12,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 20:27:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-30 20:27:12,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-09-30 20:27:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-30 20:27:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-30 20:27:12,745 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-09-30 20:27:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:12,746 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-30 20:27:12,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-30 20:27:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-30 20:27:12,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-30 20:27:12,747 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:12,747 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-09-30 20:27:12,747 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:12,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:12,747 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-09-30 20:27:12,747 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:12,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:12,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:12,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:12,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:15,398 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:15,398 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-09-30 20:27:15,406 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:27:15,451 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:27:15,451 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:15,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:15,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:15,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:15,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:15,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:16,651 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:16,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-09-30 20:27:16,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-30 20:27:16,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-30 20:27:16,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-30 20:27:16,653 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-09-30 20:27:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:17,195 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-30 20:27:17,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 20:27:17,195 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-09-30 20:27:17,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:17,197 INFO L225 Difference]: With dead ends: 171 [2018-09-30 20:27:17,197 INFO L226 Difference]: Without dead ends: 170 [2018-09-30 20:27:17,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-30 20:27:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-30 20:27:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-09-30 20:27:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-30 20:27:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-30 20:27:17,202 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-09-30 20:27:17,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:17,202 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-30 20:27:17,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-30 20:27:17,202 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-30 20:27:17,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-30 20:27:17,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:17,203 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-09-30 20:27:17,203 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:17,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:17,203 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-09-30 20:27:17,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:17,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:17,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:17,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:17,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:19,144 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:19,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 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-09-30 20:27:19,159 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:27:19,314 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-30 20:27:19,314 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:19,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:19,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:19,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:19,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:19,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:20,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:20,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-09-30 20:27:20,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-30 20:27:20,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-30 20:27:20,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 20:27:20,515 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-09-30 20:27:20,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:20,833 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-30 20:27:20,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 20:27:20,833 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-09-30 20:27:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:20,834 INFO L225 Difference]: With dead ends: 175 [2018-09-30 20:27:20,835 INFO L226 Difference]: Without dead ends: 174 [2018-09-30 20:27:20,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 20:27:20,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-30 20:27:20,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-09-30 20:27:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-30 20:27:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-30 20:27:20,841 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-09-30 20:27:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:20,841 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-30 20:27:20,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-30 20:27:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-30 20:27:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-30 20:27:20,842 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:20,843 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-09-30 20:27:20,843 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:20,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:20,843 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-09-30 20:27:20,843 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:20,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:20,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:20,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:20,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:22,888 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:22,888 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) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:22,901 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:27:23,086 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-30 20:27:23,086 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:23,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:23,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:23,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:23,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:23,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:24,298 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:24,299 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-09-30 20:27:24,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-30 20:27:24,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-30 20:27:24,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-30 20:27:24,301 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-09-30 20:27:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:24,907 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-30 20:27:24,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 20:27:24,908 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-09-30 20:27:24,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:24,909 INFO L225 Difference]: With dead ends: 179 [2018-09-30 20:27:24,909 INFO L226 Difference]: Without dead ends: 178 [2018-09-30 20:27:24,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-30 20:27:24,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-30 20:27:24,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-09-30 20:27:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-30 20:27:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-30 20:27:24,915 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-09-30 20:27:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:24,915 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-30 20:27:24,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-30 20:27:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-30 20:27:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-30 20:27:24,916 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:24,917 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-09-30 20:27:24,917 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:24,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:24,917 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-09-30 20:27:24,917 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:24,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:24,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:24,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:24,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:26,299 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:26,299 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-09-30 20:27:26,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:26,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:26,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:26,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:26,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:26,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:27,889 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:27,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-09-30 20:27:27,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-30 20:27:27,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-30 20:27:27,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-30 20:27:27,892 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-09-30 20:27:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:28,179 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-30 20:27:28,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-30 20:27:28,180 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-09-30 20:27:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:28,181 INFO L225 Difference]: With dead ends: 183 [2018-09-30 20:27:28,181 INFO L226 Difference]: Without dead ends: 182 [2018-09-30 20:27:28,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-30 20:27:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-30 20:27:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-09-30 20:27:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-30 20:27:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-30 20:27:28,186 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-09-30 20:27:28,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:28,186 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-30 20:27:28,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-30 20:27:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-30 20:27:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-30 20:27:28,187 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:28,187 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-09-30 20:27:28,187 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:28,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:28,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-09-30 20:27:28,188 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:28,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:28,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:28,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:28,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:29,309 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:29,309 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-09-30 20:27:29,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:27:29,359 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:27:29,360 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:29,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:29,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:29,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:29,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:29,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:30,816 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:30,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-09-30 20:27:30,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-30 20:27:30,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-30 20:27:30,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-30 20:27:30,818 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-09-30 20:27:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:31,097 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-30 20:27:31,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 20:27:31,097 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-09-30 20:27:31,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:31,099 INFO L225 Difference]: With dead ends: 187 [2018-09-30 20:27:31,099 INFO L226 Difference]: Without dead ends: 186 [2018-09-30 20:27:31,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-30 20:27:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-30 20:27:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-09-30 20:27:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-30 20:27:31,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-30 20:27:31,105 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-09-30 20:27:31,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:31,106 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-30 20:27:31,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-30 20:27:31,106 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-30 20:27:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-30 20:27:31,107 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:31,107 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-09-30 20:27:31,107 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:31,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:31,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-09-30 20:27:31,108 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:31,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:31,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:31,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:31,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:32,876 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:32,876 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-09-30 20:27:32,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:27:33,048 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-30 20:27:33,048 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:33,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:33,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:33,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:33,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:33,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:34,438 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:34,438 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-09-30 20:27:34,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-30 20:27:34,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-30 20:27:34,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 20:27:34,440 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-09-30 20:27:34,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:34,747 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-30 20:27:34,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 20:27:34,747 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-09-30 20:27:34,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:34,749 INFO L225 Difference]: With dead ends: 191 [2018-09-30 20:27:34,749 INFO L226 Difference]: Without dead ends: 190 [2018-09-30 20:27:34,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 20:27:34,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-30 20:27:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-09-30 20:27:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-30 20:27:34,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-30 20:27:34,756 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-09-30 20:27:34,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:34,757 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-30 20:27:34,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-30 20:27:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-30 20:27:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-30 20:27:34,757 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:34,758 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-09-30 20:27:34,758 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:34,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:34,758 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-09-30 20:27:34,758 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:34,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:34,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:34,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:34,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:36,116 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:36,116 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-09-30 20:27:36,142 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:27:36,195 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:27:36,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:36,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:36,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:36,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:36,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:36,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:38,862 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:38,862 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-09-30 20:27:38,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-30 20:27:38,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-30 20:27:38,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-30 20:27:38,864 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-09-30 20:27:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:39,335 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-30 20:27:39,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 20:27:39,336 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-09-30 20:27:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:39,337 INFO L225 Difference]: With dead ends: 195 [2018-09-30 20:27:39,337 INFO L226 Difference]: Without dead ends: 194 [2018-09-30 20:27:39,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-30 20:27:39,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-30 20:27:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-09-30 20:27:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-30 20:27:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-30 20:27:39,344 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-09-30 20:27:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:39,344 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-30 20:27:39,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-30 20:27:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-30 20:27:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-30 20:27:39,346 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:39,346 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-09-30 20:27:39,346 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:39,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:39,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-09-30 20:27:39,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:39,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:39,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:39,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:39,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:40,625 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:40,625 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-09-30 20:27:40,632 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:27:40,752 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-30 20:27:40,752 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:40,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:40,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:40,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:40,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:40,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:42,647 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:42,648 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-09-30 20:27:42,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-30 20:27:42,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-30 20:27:42,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-30 20:27:42,649 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-09-30 20:27:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:43,094 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-30 20:27:43,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 20:27:43,095 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-09-30 20:27:43,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:43,096 INFO L225 Difference]: With dead ends: 199 [2018-09-30 20:27:43,097 INFO L226 Difference]: Without dead ends: 198 [2018-09-30 20:27:43,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-30 20:27:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-30 20:27:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-09-30 20:27:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-30 20:27:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-30 20:27:43,104 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-09-30 20:27:43,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:43,104 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-30 20:27:43,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-30 20:27:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-30 20:27:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-30 20:27:43,106 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:43,106 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-09-30 20:27:43,106 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:43,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:43,106 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-09-30 20:27:43,106 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:43,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:43,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:43,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:43,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:44,553 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:44,553 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-09-30 20:27:44,560 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:27:44,852 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-30 20:27:44,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:44,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:44,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:44,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:44,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:44,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:46,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:46,361 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:46,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-09-30 20:27:46,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-30 20:27:46,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-30 20:27:46,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 20:27:46,363 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-09-30 20:27:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:46,722 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-30 20:27:46,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 20:27:46,723 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-09-30 20:27:46,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:46,724 INFO L225 Difference]: With dead ends: 203 [2018-09-30 20:27:46,724 INFO L226 Difference]: Without dead ends: 202 [2018-09-30 20:27:46,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 20:27:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-30 20:27:46,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-09-30 20:27:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-30 20:27:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-30 20:27:46,730 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-09-30 20:27:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:46,730 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-30 20:27:46,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-30 20:27:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-30 20:27:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-30 20:27:46,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:46,731 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-09-30 20:27:46,732 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:46,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:46,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-09-30 20:27:46,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:46,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:46,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:46,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:46,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:48,395 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:48,395 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-09-30 20:27:48,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:48,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:48,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:48,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:48,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:48,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:50,013 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:50,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-09-30 20:27:50,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-30 20:27:50,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-30 20:27:50,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 20:27:50,015 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-09-30 20:27:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:50,336 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-30 20:27:50,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 20:27:50,337 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-09-30 20:27:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:50,338 INFO L225 Difference]: With dead ends: 207 [2018-09-30 20:27:50,339 INFO L226 Difference]: Without dead ends: 206 [2018-09-30 20:27:50,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 20:27:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-30 20:27:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-09-30 20:27:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-30 20:27:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-30 20:27:50,345 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-09-30 20:27:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:50,345 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-30 20:27:50,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-30 20:27:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-30 20:27:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-30 20:27:50,346 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:50,347 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-09-30 20:27:50,347 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:50,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:50,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-09-30 20:27:50,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:50,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:50,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:50,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:50,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:51,790 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:51,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 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-09-30 20:27:51,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:27:51,940 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:27:51,940 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:51,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:51,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:51,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:51,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:51,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:54,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:54,184 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:54,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-09-30 20:27:54,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-30 20:27:54,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-30 20:27:54,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-30 20:27:54,186 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-09-30 20:27:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:54,500 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-30 20:27:54,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 20:27:54,500 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-09-30 20:27:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:54,502 INFO L225 Difference]: With dead ends: 211 [2018-09-30 20:27:54,502 INFO L226 Difference]: Without dead ends: 210 [2018-09-30 20:27:54,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-30 20:27:54,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-30 20:27:54,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-09-30 20:27:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-30 20:27:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-30 20:27:54,508 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-09-30 20:27:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:54,509 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-30 20:27:54,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-30 20:27:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-30 20:27:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-30 20:27:54,510 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:54,510 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-09-30 20:27:54,510 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:54,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:54,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-09-30 20:27:54,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:54,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:54,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:54,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:54,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:55,918 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:55,918 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-09-30 20:27:55,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:27:56,447 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-30 20:27:56,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:56,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:56,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:56,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:56,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:56,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:58,428 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:58,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-09-30 20:27:58,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-30 20:27:58,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-30 20:27:58,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 20:27:58,431 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-09-30 20:27:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:58,771 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-30 20:27:58,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 20:27:58,772 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-09-30 20:27:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:58,774 INFO L225 Difference]: With dead ends: 215 [2018-09-30 20:27:58,774 INFO L226 Difference]: Without dead ends: 214 [2018-09-30 20:27:58,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 20:27:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-30 20:27:58,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-09-30 20:27:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-30 20:27:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-09-30 20:27:58,780 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-09-30 20:27:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:58,781 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-09-30 20:27:58,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-30 20:27:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-09-30 20:27:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-30 20:27:58,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:58,782 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-09-30 20:27:58,782 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:58,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:58,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-09-30 20:27:58,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:58,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:58,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:58,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:58,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:00,184 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:00,184 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-09-30 20:28:00,191 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:28:00,246 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:28:00,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:00,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:00,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:00,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:00,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:00,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:02,128 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:02,128 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-09-30 20:28:02,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-30 20:28:02,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-30 20:28:02,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-30 20:28:02,130 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-09-30 20:28:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:02,494 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-09-30 20:28:02,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-30 20:28:02,494 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-09-30 20:28:02,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:02,496 INFO L225 Difference]: With dead ends: 219 [2018-09-30 20:28:02,496 INFO L226 Difference]: Without dead ends: 218 [2018-09-30 20:28:02,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-30 20:28:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-30 20:28:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-09-30 20:28:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-30 20:28:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-30 20:28:02,501 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-09-30 20:28:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:02,501 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-30 20:28:02,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-30 20:28:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-30 20:28:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-30 20:28:02,502 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:02,502 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-09-30 20:28:02,503 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:02,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-09-30 20:28:02,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:02,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:02,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:02,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:04,306 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:04,306 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-09-30 20:28:04,314 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:28:04,452 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-30 20:28:04,453 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:04,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:04,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:04,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:04,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:04,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:06,303 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:06,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-09-30 20:28:06,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-30 20:28:06,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-30 20:28:06,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 20:28:06,306 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-09-30 20:28:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:06,688 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-09-30 20:28:06,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 20:28:06,688 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-09-30 20:28:06,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:06,690 INFO L225 Difference]: With dead ends: 223 [2018-09-30 20:28:06,690 INFO L226 Difference]: Without dead ends: 222 [2018-09-30 20:28:06,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 20:28:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-30 20:28:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-09-30 20:28:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-30 20:28:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-30 20:28:06,695 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-09-30 20:28:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:06,695 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-30 20:28:06,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-30 20:28:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-30 20:28:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-30 20:28:06,696 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:06,696 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-09-30 20:28:06,696 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:06,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-09-30 20:28:06,697 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:06,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:06,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:06,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:06,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:08,556 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:08,556 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-09-30 20:28:08,563 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:28:08,749 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-30 20:28:08,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:08,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:08,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:08,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:08,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:08,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:10,647 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:10,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-09-30 20:28:10,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-30 20:28:10,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-30 20:28:10,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-30 20:28:10,650 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-09-30 20:28:10,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:10,973 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-09-30 20:28:10,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 20:28:10,974 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-09-30 20:28:10,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:10,976 INFO L225 Difference]: With dead ends: 227 [2018-09-30 20:28:10,976 INFO L226 Difference]: Without dead ends: 226 [2018-09-30 20:28:10,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-30 20:28:10,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-30 20:28:10,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-09-30 20:28:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-30 20:28:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-09-30 20:28:10,982 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-09-30 20:28:10,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:10,983 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-09-30 20:28:10,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-30 20:28:10,983 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-09-30 20:28:10,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-30 20:28:10,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:10,984 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-09-30 20:28:10,985 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:10,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:10,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-09-30 20:28:10,985 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:10,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:10,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:10,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:10,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:12,588 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:12,588 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-09-30 20:28:12,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:28:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:12,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:12,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:12,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:12,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:12,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:14,824 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:14,825 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-09-30 20:28:14,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-30 20:28:14,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-30 20:28:14,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-30 20:28:14,827 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-09-30 20:28:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:15,222 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-30 20:28:15,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-30 20:28:15,222 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-09-30 20:28:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:15,224 INFO L225 Difference]: With dead ends: 231 [2018-09-30 20:28:15,224 INFO L226 Difference]: Without dead ends: 230 [2018-09-30 20:28:15,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-30 20:28:15,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-30 20:28:15,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-09-30 20:28:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-30 20:28:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-09-30 20:28:15,231 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-09-30 20:28:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:15,231 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-09-30 20:28:15,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-30 20:28:15,232 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-09-30 20:28:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-30 20:28:15,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:15,233 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-09-30 20:28:15,233 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:15,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:15,234 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-09-30 20:28:15,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:15,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:15,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:15,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:28:15,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:16,925 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:16,925 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-09-30 20:28:16,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:28:16,996 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:28:16,997 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:17,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:17,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:17,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:17,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:17,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:19,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:19,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-09-30 20:28:19,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-30 20:28:19,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-30 20:28:19,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-30 20:28:19,754 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-09-30 20:28:20,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:20,165 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-30 20:28:20,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 20:28:20,165 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-09-30 20:28:20,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:20,167 INFO L225 Difference]: With dead ends: 235 [2018-09-30 20:28:20,167 INFO L226 Difference]: Without dead ends: 234 [2018-09-30 20:28:20,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-30 20:28:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-30 20:28:20,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-09-30 20:28:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-30 20:28:20,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-30 20:28:20,172 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-09-30 20:28:20,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:20,172 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-30 20:28:20,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-30 20:28:20,172 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-30 20:28:20,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-30 20:28:20,173 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:20,174 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-09-30 20:28:20,174 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:20,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:20,174 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-09-30 20:28:20,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:20,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:20,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:20,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:20,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:21,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:21,902 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:21,902 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-09-30 20:28:21,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:28:22,153 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-30 20:28:22,153 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:22,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:22,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:22,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:22,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:22,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:24,652 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:24,652 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-09-30 20:28:24,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-30 20:28:24,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-30 20:28:24,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-30 20:28:24,654 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-09-30 20:28:25,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:25,051 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-09-30 20:28:25,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-30 20:28:25,052 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-09-30 20:28:25,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:25,053 INFO L225 Difference]: With dead ends: 239 [2018-09-30 20:28:25,053 INFO L226 Difference]: Without dead ends: 238 [2018-09-30 20:28:25,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-30 20:28:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-30 20:28:25,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-09-30 20:28:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-30 20:28:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-30 20:28:25,058 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-09-30 20:28:25,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:25,058 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-30 20:28:25,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-30 20:28:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-30 20:28:25,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-30 20:28:25,059 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:25,060 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-09-30 20:28:25,060 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:25,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:25,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-09-30 20:28:25,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:25,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:25,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:25,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:25,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:27,027 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:27,027 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-09-30 20:28:27,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:28:27,104 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:28:27,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:27,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:27,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:27,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:27,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:27,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:29,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:29,458 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:29,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-09-30 20:28:29,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-30 20:28:29,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-30 20:28:29,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-30 20:28:29,460 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-09-30 20:28:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:29,881 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-09-30 20:28:29,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-30 20:28:29,881 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-09-30 20:28:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:29,883 INFO L225 Difference]: With dead ends: 243 [2018-09-30 20:28:29,883 INFO L226 Difference]: Without dead ends: 242 [2018-09-30 20:28:29,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-30 20:28:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-30 20:28:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-09-30 20:28:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-30 20:28:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-30 20:28:29,889 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-09-30 20:28:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:29,889 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-30 20:28:29,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-30 20:28:29,889 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-30 20:28:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-30 20:28:29,890 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:29,890 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-09-30 20:28:29,890 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:29,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:29,891 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-09-30 20:28:29,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:29,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:29,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:29,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:29,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:31,869 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:31,869 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-09-30 20:28:31,876 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:28:32,034 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-30 20:28:32,034 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:32,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:32,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:32,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:32,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:32,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:34,521 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:34,521 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-09-30 20:28:34,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-30 20:28:34,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-30 20:28:34,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-30 20:28:34,523 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-09-30 20:28:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:34,898 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-09-30 20:28:34,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-30 20:28:34,898 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-09-30 20:28:34,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:34,900 INFO L225 Difference]: With dead ends: 247 [2018-09-30 20:28:34,900 INFO L226 Difference]: Without dead ends: 246 [2018-09-30 20:28:34,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-30 20:28:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-30 20:28:34,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-09-30 20:28:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-30 20:28:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-30 20:28:34,908 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-09-30 20:28:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:34,908 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-30 20:28:34,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-30 20:28:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-30 20:28:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-30 20:28:34,909 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:34,909 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-09-30 20:28:34,910 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:34,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:34,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-09-30 20:28:34,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:34,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:34,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:34,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:34,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:36,793 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:36,793 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-09-30 20:28:36,801 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:28:37,022 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-09-30 20:28:37,023 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:37,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:37,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:37,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:37,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:37,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:39,578 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:39,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-09-30 20:28:39,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-30 20:28:39,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-30 20:28:39,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-30 20:28:39,580 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-09-30 20:28:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:40,067 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-30 20:28:40,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-30 20:28:40,067 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-09-30 20:28:40,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:40,069 INFO L225 Difference]: With dead ends: 251 [2018-09-30 20:28:40,069 INFO L226 Difference]: Without dead ends: 250 [2018-09-30 20:28:40,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-30 20:28:40,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-30 20:28:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-09-30 20:28:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-30 20:28:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-09-30 20:28:40,076 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-09-30 20:28:40,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:40,076 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-09-30 20:28:40,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-30 20:28:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-09-30 20:28:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-30 20:28:40,077 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:40,078 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-09-30 20:28:40,078 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:40,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:40,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-09-30 20:28:40,078 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:40,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:40,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:42,014 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:42,015 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-09-30 20:28:42,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:28:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:42,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:42,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:42,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:42,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:42,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:44,675 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:44,675 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-09-30 20:28:44,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-30 20:28:44,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-30 20:28:44,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-30 20:28:44,677 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-09-30 20:28:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:45,112 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-30 20:28:45,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-30 20:28:45,112 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-09-30 20:28:45,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:45,114 INFO L225 Difference]: With dead ends: 255 [2018-09-30 20:28:45,114 INFO L226 Difference]: Without dead ends: 254 [2018-09-30 20:28:45,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-30 20:28:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-30 20:28:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-09-30 20:28:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-30 20:28:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-09-30 20:28:45,119 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-09-30 20:28:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:45,119 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-09-30 20:28:45,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-30 20:28:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-09-30 20:28:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-30 20:28:45,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:45,121 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-09-30 20:28:45,121 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:45,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:45,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-09-30 20:28:45,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:45,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:45,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:45,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:28:45,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:47,072 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:47,072 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-09-30 20:28:47,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:28:47,144 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:28:47,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:47,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:47,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:47,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:47,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:47,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:49,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:49,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2018-09-30 20:28:49,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-30 20:28:49,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-30 20:28:49,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-30 20:28:49,751 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-09-30 20:28:50,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:50,196 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-09-30 20:28:50,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-30 20:28:50,196 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-09-30 20:28:50,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:50,197 INFO L225 Difference]: With dead ends: 259 [2018-09-30 20:28:50,197 INFO L226 Difference]: Without dead ends: 258 [2018-09-30 20:28:50,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-30 20:28:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-09-30 20:28:50,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-09-30 20:28:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-30 20:28:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-30 20:28:50,203 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-09-30 20:28:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:50,203 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-30 20:28:50,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-30 20:28:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-30 20:28:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-30 20:28:50,204 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:50,204 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-09-30 20:28:50,204 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:50,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:50,205 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-09-30 20:28:50,205 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:50,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:50,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:50,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:50,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:52,302 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:52,302 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-09-30 20:28:52,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:28:52,627 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-09-30 20:28:52,628 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:52,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:52,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:52,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:52,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:52,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:55,363 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:55,363 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2018-09-30 20:28:55,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-30 20:28:55,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-30 20:28:55,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-30 20:28:55,365 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-09-30 20:28:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:55,824 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-09-30 20:28:55,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-30 20:28:55,825 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-09-30 20:28:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:55,826 INFO L225 Difference]: With dead ends: 263 [2018-09-30 20:28:55,826 INFO L226 Difference]: Without dead ends: 262 [2018-09-30 20:28:55,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-30 20:28:55,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-09-30 20:28:55,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-09-30 20:28:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-30 20:28:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-30 20:28:55,833 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-09-30 20:28:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:55,833 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-30 20:28:55,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-30 20:28:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-30 20:28:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-30 20:28:55,834 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:55,835 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-09-30 20:28:55,835 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:55,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:55,835 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-09-30 20:28:55,835 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:55,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:55,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:55,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:55,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:57,938 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:57,938 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-09-30 20:28:57,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:28:58,017 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:28:58,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:58,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:58,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:58,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:58,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:58,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:01,165 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:01,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2018-09-30 20:29:01,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-30 20:29:01,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-30 20:29:01,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 20:29:01,167 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-09-30 20:29:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:01,635 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-09-30 20:29:01,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-30 20:29:01,635 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-09-30 20:29:01,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:01,637 INFO L225 Difference]: With dead ends: 267 [2018-09-30 20:29:01,637 INFO L226 Difference]: Without dead ends: 266 [2018-09-30 20:29:01,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 20:29:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-09-30 20:29:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-09-30 20:29:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-30 20:29:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-09-30 20:29:01,644 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-09-30 20:29:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:01,645 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-09-30 20:29:01,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-30 20:29:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-09-30 20:29:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-30 20:29:01,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:01,646 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-09-30 20:29:01,647 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:01,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:01,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-09-30 20:29:01,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:01,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:01,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:01,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:01,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:03,894 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:03,894 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-09-30 20:29:03,903 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:29:04,104 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-09-30 20:29:04,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:04,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:04,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:04,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:04,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:04,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:07,106 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:07,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2018-09-30 20:29:07,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-30 20:29:07,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-30 20:29:07,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-30 20:29:07,108 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-09-30 20:29:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:07,620 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-09-30 20:29:07,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-30 20:29:07,620 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-09-30 20:29:07,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:07,622 INFO L225 Difference]: With dead ends: 271 [2018-09-30 20:29:07,622 INFO L226 Difference]: Without dead ends: 270 [2018-09-30 20:29:07,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-30 20:29:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-30 20:29:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-09-30 20:29:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-30 20:29:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-09-30 20:29:07,630 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-09-30 20:29:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:07,630 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-09-30 20:29:07,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-30 20:29:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-09-30 20:29:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-30 20:29:07,631 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:07,632 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-09-30 20:29:07,632 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:07,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:07,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-09-30 20:29:07,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:07,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:07,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:07,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:07,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:10,130 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:10,130 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-09-30 20:29:10,136 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:29:10,401 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-09-30 20:29:10,401 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:10,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:10,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:10,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:10,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:10,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:13,112 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:13,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2018-09-30 20:29:13,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-30 20:29:13,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-30 20:29:13,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-30 20:29:13,115 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-09-30 20:29:13,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:13,696 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-30 20:29:13,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 20:29:13,697 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-09-30 20:29:13,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:13,698 INFO L225 Difference]: With dead ends: 275 [2018-09-30 20:29:13,698 INFO L226 Difference]: Without dead ends: 274 [2018-09-30 20:29:13,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-30 20:29:13,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-30 20:29:13,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-09-30 20:29:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-30 20:29:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-09-30 20:29:13,706 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-09-30 20:29:13,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:13,706 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-09-30 20:29:13,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-30 20:29:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-09-30 20:29:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-30 20:29:13,707 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:13,708 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-09-30 20:29:13,708 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:13,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:13,708 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-09-30 20:29:13,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:13,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:13,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:13,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:13,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:16,288 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:16,288 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-09-30 20:29:16,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:29:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:16,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:16,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:16,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:16,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:16,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:19,178 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:19,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2018-09-30 20:29:19,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-30 20:29:19,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-30 20:29:19,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-30 20:29:19,181 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-09-30 20:29:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:19,667 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-09-30 20:29:19,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-30 20:29:19,667 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-09-30 20:29:19,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:19,669 INFO L225 Difference]: With dead ends: 279 [2018-09-30 20:29:19,669 INFO L226 Difference]: Without dead ends: 278 [2018-09-30 20:29:19,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-30 20:29:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-30 20:29:19,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-09-30 20:29:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-30 20:29:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-09-30 20:29:19,677 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-09-30 20:29:19,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:19,677 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-09-30 20:29:19,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-30 20:29:19,677 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-09-30 20:29:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-30 20:29:19,679 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:19,679 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-09-30 20:29:19,679 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:19,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:19,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-09-30 20:29:19,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:19,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:19,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:19,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:29:19,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:22,061 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:22,061 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-09-30 20:29:22,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:29:22,136 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:29:22,137 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:22,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:22,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:22,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:22,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:22,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:25,198 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:25,199 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2018-09-30 20:29:25,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-30 20:29:25,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-30 20:29:25,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-30 20:29:25,201 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-09-30 20:29:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:25,714 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-09-30 20:29:25,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-30 20:29:25,715 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-09-30 20:29:25,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:25,717 INFO L225 Difference]: With dead ends: 283 [2018-09-30 20:29:25,717 INFO L226 Difference]: Without dead ends: 282 [2018-09-30 20:29:25,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-30 20:29:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-30 20:29:25,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-09-30 20:29:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-30 20:29:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-30 20:29:25,723 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-09-30 20:29:25,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:25,723 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-30 20:29:25,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-30 20:29:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-30 20:29:25,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-30 20:29:25,724 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:25,725 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-09-30 20:29:25,725 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:25,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:25,725 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-09-30 20:29:25,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:25,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:25,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:25,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:25,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:28,150 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:28,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 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-09-30 20:29:28,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:29:28,528 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-09-30 20:29:28,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:28,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:28,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:28,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:28,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:28,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:31,644 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:31,644 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2018-09-30 20:29:31,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-30 20:29:31,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-30 20:29:31,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-30 20:29:31,647 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-09-30 20:29:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:32,134 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-09-30 20:29:32,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-30 20:29:32,135 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-09-30 20:29:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:32,136 INFO L225 Difference]: With dead ends: 287 [2018-09-30 20:29:32,137 INFO L226 Difference]: Without dead ends: 286 [2018-09-30 20:29:32,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-30 20:29:32,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-30 20:29:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-09-30 20:29:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-30 20:29:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-09-30 20:29:32,142 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-09-30 20:29:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:32,142 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-09-30 20:29:32,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-30 20:29:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-09-30 20:29:32,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-30 20:29:32,143 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:32,143 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-09-30 20:29:32,143 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:32,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:32,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-09-30 20:29:32,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:32,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:32,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:32,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:32,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:34,667 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:34,667 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-09-30 20:29:34,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:29:34,755 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:29:34,755 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:34,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:34,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:34,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:34,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:34,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:37,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:37,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2018-09-30 20:29:37,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-30 20:29:37,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-30 20:29:37,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-30 20:29:37,822 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-09-30 20:29:38,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:38,439 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-09-30 20:29:38,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-30 20:29:38,439 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-09-30 20:29:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:38,441 INFO L225 Difference]: With dead ends: 291 [2018-09-30 20:29:38,441 INFO L226 Difference]: Without dead ends: 290 [2018-09-30 20:29:38,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-30 20:29:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-30 20:29:38,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-09-30 20:29:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-30 20:29:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-09-30 20:29:38,446 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-09-30 20:29:38,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:38,446 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-09-30 20:29:38,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-30 20:29:38,446 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-09-30 20:29:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-30 20:29:38,447 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:38,447 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-09-30 20:29:38,448 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:38,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:38,448 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-09-30 20:29:38,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:38,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:38,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:38,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:38,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:41,082 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:41,082 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-09-30 20:29:41,089 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:29:41,301 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-09-30 20:29:41,301 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:41,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:41,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:41,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:41,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:41,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:44,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:44,365 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:44,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2018-09-30 20:29:44,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-30 20:29:44,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-30 20:29:44,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-30 20:29:44,369 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-09-30 20:29:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:44,908 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-30 20:29:44,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-30 20:29:44,908 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-09-30 20:29:44,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:44,910 INFO L225 Difference]: With dead ends: 295 [2018-09-30 20:29:44,910 INFO L226 Difference]: Without dead ends: 294 [2018-09-30 20:29:44,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-30 20:29:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-30 20:29:44,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-09-30 20:29:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-30 20:29:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-09-30 20:29:44,916 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-09-30 20:29:44,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:44,916 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-09-30 20:29:44,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-30 20:29:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-09-30 20:29:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-30 20:29:44,918 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:44,918 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-09-30 20:29:44,918 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:44,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:44,919 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-09-30 20:29:44,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:44,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:44,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:44,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:44,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:47,735 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:47,735 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-09-30 20:29:47,742 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:29:48,050 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-09-30 20:29:48,050 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:48,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:48,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:48,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:48,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:48,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:51,175 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:51,175 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2018-09-30 20:29:51,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-30 20:29:51,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-30 20:29:51,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-30 20:29:51,178 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-09-30 20:29:51,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:51,669 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-09-30 20:29:51,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-30 20:29:51,670 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-09-30 20:29:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:51,672 INFO L225 Difference]: With dead ends: 299 [2018-09-30 20:29:51,672 INFO L226 Difference]: Without dead ends: 298 [2018-09-30 20:29:51,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-30 20:29:51,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-09-30 20:29:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-09-30 20:29:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-30 20:29:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-09-30 20:29:51,678 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-09-30 20:29:51,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:51,678 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-09-30 20:29:51,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-30 20:29:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-09-30 20:29:51,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-30 20:29:51,679 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:51,679 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-09-30 20:29:51,679 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:51,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:51,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-09-30 20:29:51,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:51,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:51,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:51,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:51,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:54,379 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:54,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-09-30 20:29:54,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:29:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:54,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:54,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:54,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:54,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:54,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:57,707 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:57,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2018-09-30 20:29:57,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-30 20:29:57,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-30 20:29:57,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-30 20:29:57,710 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-09-30 20:29:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:58,193 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-09-30 20:29:58,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-30 20:29:58,194 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-09-30 20:29:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:58,195 INFO L225 Difference]: With dead ends: 303 [2018-09-30 20:29:58,196 INFO L226 Difference]: Without dead ends: 302 [2018-09-30 20:29:58,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-30 20:29:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-30 20:29:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-09-30 20:29:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-30 20:29:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-30 20:29:58,202 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-09-30 20:29:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:58,202 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-30 20:29:58,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-30 20:29:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-30 20:29:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-30 20:29:58,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:58,204 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-09-30 20:29:58,204 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:58,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:58,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-09-30 20:29:58,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:58,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:58,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:58,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:29:58,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:30:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:30:00,965 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:30:00,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 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-09-30 20:30:00,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:30:01,048 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:30:01,048 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:30:01,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:30:01,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:30:01,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:30:01,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:30:01,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:30:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:30:04,331 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:30:04,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2018-09-30 20:30:04,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-30 20:30:04,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-30 20:30:04,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-30 20:30:04,334 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-09-30 20:30:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:30:04,819 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-09-30 20:30:04,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-30 20:30:04,820 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-09-30 20:30:04,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:30:04,821 INFO L225 Difference]: With dead ends: 307 [2018-09-30 20:30:04,822 INFO L226 Difference]: Without dead ends: 306 [2018-09-30 20:30:04,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11100 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-30 20:30:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-30 20:30:04,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-09-30 20:30:04,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-30 20:30:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-09-30 20:30:04,827 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-09-30 20:30:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:30:04,828 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-09-30 20:30:04,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-30 20:30:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-09-30 20:30:04,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-30 20:30:04,829 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:30:04,829 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-09-30 20:30:04,829 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:30:04,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:30:04,829 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-09-30 20:30:04,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:30:04,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:30:04,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:30:04,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:30:04,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:30:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:30:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:30:07,637 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:30:07,637 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-09-30 20:30:07,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:30:08,073 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-09-30 20:30:08,073 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:30:08,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:30:08,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:30:08,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:30:08,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:30:08,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 Received shutdown request... [2018-09-30 20:30:09,965 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-30 20:30:10,166 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:30:10,166 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 20:30:10,172 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 20:30:10,172 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:30:10 BoogieIcfgContainer [2018-09-30 20:30:10,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:30:10,173 INFO L168 Benchmark]: Toolchain (without parser) took 237358.65 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 872.4 MB. Max. memory is 7.1 GB. [2018-09-30 20:30:10,174 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-09-30 20:30:10,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.99 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-09-30 20:30:10,175 INFO L168 Benchmark]: Boogie Preprocessor took 31.92 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-09-30 20:30:10,175 INFO L168 Benchmark]: RCFGBuilder took 342.17 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-09-30 20:30:10,175 INFO L168 Benchmark]: TraceAbstraction took 236911.14 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 853.4 MB. Max. memory is 7.1 GB. [2018-09-30 20:30:10,177 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.21 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 66.99 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 31.92 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 342.17 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 236911.14 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 853.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 305 with TraceHistMax 76, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 136 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 236.8s OverallTime, 76 OverallIterations, 76 TraceHistogramMax, 22.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 226 SDtfs, 4157 SDslu, 4208 SDs, 0 SdLazy, 15683 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14172 GetRequests, 8473 SyntacticMatches, 0 SemanticMatches, 5699 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281200 ImplicationChecksByTransitivity, 181.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=75, 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.3s AutomataMinimizationTime, 75 MinimizatonAttempts, 75 StatesRemovedByMinimization, 75 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 8.2s SatisfiabilityAnalysisTime, 193.4s InterpolantComputationTime, 22796 NumberOfCodeBlocks, 22796 NumberOfCodeBlocksAsserted, 1530 NumberOfCheckSat, 22647 ConstructedInterpolants, 0 QuantifiedInterpolants, 36359519 SizeOfPredicates, 444 NumberOfNonLiveVariables, 21127 ConjunctsInSsa, 9065 ConjunctsInUnsatCore, 149 InterpolantComputations, 1 PerfectInterpolantSequences, 0/556850 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/PointerIncrement-simplified03.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-30-10-185.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified03.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-30-10-185.csv Completed graceful shutdown