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 -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:25:12,776 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:25:12,779 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:25:12,792 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:25:12,792 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:25:12,793 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:25:12,795 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:25:12,797 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:25:12,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:25:12,800 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:25:12,801 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:25:12,801 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:25:12,802 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:25:12,803 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:25:12,804 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:25:12,805 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:25:12,806 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:25:12,808 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:25:12,810 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:25:12,811 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:25:12,812 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:25:12,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:25:12,816 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:25:12,816 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:25:12,816 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:25:12,817 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:25:12,818 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:25:12,819 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:25:12,820 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:25:12,821 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:25:12,821 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:25:12,822 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:25:12,822 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:25:12,822 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:25:12,823 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:25:12,824 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:25:12,824 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:25:12,833 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:25:12,833 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:25:12,835 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:25:12,835 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:25:12,835 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:25:12,835 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:25:12,836 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:25:12,836 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:25:12,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:25:12,898 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:25:12,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:25:12,907 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:25:12,908 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:25:12,909 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-26 08:25:12,909 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2018-09-26 08:25:12,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:25:12,986 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:25:12,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:25:12,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:25:12,987 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:25:13,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:25:12" (1/1) ... [2018-09-26 08:25:13,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:25:12" (1/1) ... [2018-09-26 08:25:13,037 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:25:13,037 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:25:13,037 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:25:13,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:25:13,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:25:13,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:25:13,060 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:25:13,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:25:12" (1/1) ... [2018-09-26 08:25:13,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:25:12" (1/1) ... [2018-09-26 08:25:13,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:25:12" (1/1) ... [2018-09-26 08:25:13,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:25:12" (1/1) ... [2018-09-26 08:25:13,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:25:12" (1/1) ... [2018-09-26 08:25:13,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:25:12" (1/1) ... [2018-09-26 08:25:13,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:25:12" (1/1) ... [2018-09-26 08:25:13,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:25:13,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:25:13,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:25:13,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:25:13,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:25:12" (1/1) ... [2018-09-26 08:25:13,192 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 08:25:13,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 08:25:13,193 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-26 08:25:13,338 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:25:13,339 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:25:13 BoogieIcfgContainer [2018-09-26 08:25:13,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:25:13,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:25:13,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:25:13,345 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:25:13,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:25:12" (1/2) ... [2018-09-26 08:25:13,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc2ade5 and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:25:13, skipping insertion in model container [2018-09-26 08:25:13,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:25:13" (2/2) ... [2018-09-26 08:25:13,349 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2018-09-26 08:25:13,362 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:25:13,372 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:25:13,422 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:25:13,423 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:25:13,423 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:25:13,423 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:25:13,424 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:25:13,424 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:25:13,424 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:25:13,424 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:25:13,424 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:25:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-09-26 08:25:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:25:13,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:13,450 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:25:13,452 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:13,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:13,459 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-26 08:25:13,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:13,563 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-26 08:25:13,566 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:25:13,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-26 08:25:13,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:25:13,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:25:13,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:25:13,591 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-09-26 08:25:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:13,627 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-09-26 08:25:13,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:25:13,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-26 08:25:13,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:13,642 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:25:13,642 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:25:13,646 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-26 08:25:13,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:25:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:25:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:25:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:25:13,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2018-09-26 08:25:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:13,685 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:25:13,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:25:13,685 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:25:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:25:13,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:13,686 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-09-26 08:25:13,686 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:13,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:13,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1864331893, now seen corresponding path program 1 times [2018-09-26 08:25:13,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:13,730 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-26 08:25:13,731 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:13,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-09-26 08:25:13,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:25:13,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:25:13,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:25:13,734 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2018-09-26 08:25:13,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:13,760 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:25:13,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:25:13,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-09-26 08:25:13,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:13,762 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:25:13,762 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:25:13,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:25:13,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:25:13,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:25:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:25:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:25:13,768 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2018-09-26 08:25:13,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:13,768 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:25:13,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:25:13,768 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:25:13,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:25:13,769 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:13,769 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1] [2018-09-26 08:25:13,769 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:13,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:13,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2089621766, now seen corresponding path program 2 times [2018-09-26 08:25:13,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:13,862 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:13,862 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:25:13,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:25:13,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:25:13,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:25:13,867 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 5 states. [2018-09-26 08:25:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:13,921 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:25:13,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:25:13,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-09-26 08:25:13,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:13,925 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:25:13,925 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:25:13,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:25:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:25:13,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:25:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:25:13,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:25:13,937 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2018-09-26 08:25:13,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:13,937 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:25:13,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:25:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:25:13,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:25:13,938 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:13,940 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1] [2018-09-26 08:25:13,941 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:13,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:13,941 INFO L82 PathProgramCache]: Analyzing trace with hash 666344661, now seen corresponding path program 3 times [2018-09-26 08:25:13,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:14,007 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:14,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:25:14,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:25:14,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:25:14,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:25:14,009 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2018-09-26 08:25:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:14,034 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:25:14,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:25:14,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-09-26 08:25:14,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:14,036 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:25:14,036 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:25:14,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:25:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:25:14,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:25:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:25:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:25:14,042 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-09-26 08:25:14,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:14,043 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:25:14,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:25:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:25:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:25:14,044 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:14,044 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1] [2018-09-26 08:25:14,044 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:14,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:14,045 INFO L82 PathProgramCache]: Analyzing trace with hash -264744282, now seen corresponding path program 4 times [2018-09-26 08:25:14,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:14,118 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:14,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:25:14,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:25:14,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:25:14,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:25:14,120 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2018-09-26 08:25:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:14,149 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:25:14,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:25:14,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-09-26 08:25:14,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:14,151 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:25:14,151 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:25:14,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:25:14,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:25:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:25:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:25:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:25:14,166 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2018-09-26 08:25:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:14,167 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:25:14,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:25:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:25:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:25:14,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:14,168 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1] [2018-09-26 08:25:14,169 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:14,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:14,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1436647627, now seen corresponding path program 5 times [2018-09-26 08:25:14,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:14,230 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:14,230 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:25:14,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:25:14,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:25:14,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:25:14,231 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2018-09-26 08:25:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:14,269 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:25:14,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:25:14,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-09-26 08:25:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:14,271 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:25:14,271 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:25:14,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:25:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:25:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:25:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:25:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:25:14,279 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2018-09-26 08:25:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:14,279 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:25:14,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:25:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:25:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:25:14,281 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:14,281 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1] [2018-09-26 08:25:14,281 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:14,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:14,282 INFO L82 PathProgramCache]: Analyzing trace with hash 179950662, now seen corresponding path program 6 times [2018-09-26 08:25:14,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:14,377 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:14,378 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:25:14,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:25:14,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:25:14,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:25:14,379 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-09-26 08:25:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:14,434 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:25:14,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:25:14,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-09-26 08:25:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:14,435 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:25:14,436 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:25:14,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:25:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:25:14,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 08:25:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:25:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:25:14,451 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2018-09-26 08:25:14,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:14,452 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:25:14,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:25:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:25:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:25:14,453 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:14,453 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1] [2018-09-26 08:25:14,456 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:14,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:14,456 INFO L82 PathProgramCache]: Analyzing trace with hash 791288213, now seen corresponding path program 7 times [2018-09-26 08:25:14,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:14,557 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:14,557 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:25:14,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:25:14,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:25:14,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:25:14,561 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2018-09-26 08:25:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:14,606 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:25:14,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:25:14,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-09-26 08:25:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:14,608 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:25:14,608 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:25:14,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:25:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:25:14,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:25:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:25:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:25:14,626 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2018-09-26 08:25:14,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:14,629 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:25:14,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:25:14,629 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:25:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:25:14,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:14,630 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1] [2018-09-26 08:25:14,630 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:14,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:14,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1808032282, now seen corresponding path program 8 times [2018-09-26 08:25:14,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:14,709 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:14,710 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:25:14,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:25:14,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:25:14,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:25:14,711 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2018-09-26 08:25:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:14,750 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:25:14,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:25:14,751 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-09-26 08:25:14,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:14,752 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:25:14,752 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:25:14,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:25:14,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:25:14,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:25:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:25:14,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:25:14,768 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2018-09-26 08:25:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:14,770 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:25:14,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:25:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:25:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:25:14,772 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:14,772 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1] [2018-09-26 08:25:14,772 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:14,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:14,774 INFO L82 PathProgramCache]: Analyzing trace with hash 95448053, now seen corresponding path program 9 times [2018-09-26 08:25:14,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:14,844 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:14,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:25:14,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:25:14,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:25:14,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:25:14,846 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 12 states. [2018-09-26 08:25:14,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:14,877 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:25:14,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:25:14,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-09-26 08:25:14,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:14,878 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:25:14,879 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:25:14,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:25:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:25:14,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:25:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:25:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:25:14,893 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2018-09-26 08:25:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:14,894 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:25:14,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:25:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:25:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:25:14,896 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:14,896 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1] [2018-09-26 08:25:14,896 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:14,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:14,897 INFO L82 PathProgramCache]: Analyzing trace with hash 224898950, now seen corresponding path program 10 times [2018-09-26 08:25:14,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:15,014 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:15,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:25:15,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:25:15,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:25:15,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:25:15,018 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 13 states. [2018-09-26 08:25:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:15,079 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:25:15,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:25:15,082 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-09-26 08:25:15,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:15,083 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:25:15,084 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:25:15,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:25:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:25:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:25:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:25:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:25:15,103 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 34 [2018-09-26 08:25:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:15,104 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:25:15,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:25:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:25:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:25:15,107 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:15,107 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1] [2018-09-26 08:25:15,108 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:15,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:15,108 INFO L82 PathProgramCache]: Analyzing trace with hash -184060331, now seen corresponding path program 11 times [2018-09-26 08:25:15,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:15,209 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:15,210 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:25:15,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:25:15,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:25:15,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:25:15,211 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 14 states. [2018-09-26 08:25:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:15,256 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:25:15,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:25:15,256 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-09-26 08:25:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:15,257 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:25:15,258 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:25:15,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:25:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:25:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:25:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:25:15,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:25:15,269 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 37 [2018-09-26 08:25:15,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:15,270 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:25:15,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:25:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:25:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:25:15,274 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:15,274 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1] [2018-09-26 08:25:15,274 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:15,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:15,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1332218150, now seen corresponding path program 12 times [2018-09-26 08:25:15,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:15,398 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:15,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:25:15,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:25:15,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:25:15,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:25:15,403 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 15 states. [2018-09-26 08:25:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:15,448 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:25:15,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:25:15,448 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-09-26 08:25:15,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:15,449 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:25:15,449 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:25:15,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:25:15,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:25:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 08:25:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:25:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:25:15,464 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 40 [2018-09-26 08:25:15,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:15,464 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:25:15,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:25:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:25:15,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:25:15,471 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:15,471 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1] [2018-09-26 08:25:15,471 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:15,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:15,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1681573707, now seen corresponding path program 13 times [2018-09-26 08:25:15,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:15,578 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:15,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:25:15,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:25:15,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:25:15,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:25:15,580 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 16 states. [2018-09-26 08:25:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:15,623 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:25:15,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:25:15,623 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-09-26 08:25:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:15,624 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:25:15,624 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:25:15,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:25:15,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:25:15,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:25:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:25:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:25:15,637 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 43 [2018-09-26 08:25:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:15,638 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:25:15,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:25:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:25:15,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:25:15,640 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:15,640 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1] [2018-09-26 08:25:15,640 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:15,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:15,641 INFO L82 PathProgramCache]: Analyzing trace with hash 736537286, now seen corresponding path program 14 times [2018-09-26 08:25:15,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:15,760 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:15,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:25:15,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:25:15,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:25:15,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:25:15,762 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 17 states. [2018-09-26 08:25:15,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:15,801 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:25:15,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:25:15,801 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-09-26 08:25:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:15,802 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:25:15,805 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:25:15,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:25:15,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:25:15,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 08:25:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:25:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 08:25:15,817 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2018-09-26 08:25:15,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:15,817 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 08:25:15,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:25:15,817 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 08:25:15,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:25:15,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:15,818 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1] [2018-09-26 08:25:15,819 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:15,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:15,819 INFO L82 PathProgramCache]: Analyzing trace with hash -805326059, now seen corresponding path program 15 times [2018-09-26 08:25:15,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:15,961 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:15,961 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:25:15,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:25:15,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:25:15,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:25:15,967 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2018-09-26 08:25:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:15,998 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:25:15,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:25:15,998 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-09-26 08:25:15,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:15,999 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:25:15,999 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:25:16,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:25:16,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:25:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:25:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:25:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:25:16,011 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2018-09-26 08:25:16,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:16,011 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:25:16,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:25:16,012 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:25:16,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:25:16,014 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:16,015 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1] [2018-09-26 08:25:16,015 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:16,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:16,016 INFO L82 PathProgramCache]: Analyzing trace with hash 218993766, now seen corresponding path program 16 times [2018-09-26 08:25:16,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:16,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:16,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:25:16,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:25:16,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:25:16,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:25:16,131 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 19 states. [2018-09-26 08:25:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:16,169 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:25:16,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:25:16,169 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-09-26 08:25:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:16,170 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:25:16,170 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:25:16,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:25:16,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:25:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-26 08:25:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:25:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:25:16,187 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2018-09-26 08:25:16,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:16,190 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:25:16,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:25:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:25:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:25:16,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:16,192 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1] [2018-09-26 08:25:16,192 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:16,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:16,192 INFO L82 PathProgramCache]: Analyzing trace with hash -11737739, now seen corresponding path program 17 times [2018-09-26 08:25:16,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:16,317 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:16,317 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:25:16,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:25:16,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:25:16,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:25:16,319 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 20 states. [2018-09-26 08:25:16,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:16,357 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:25:16,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:25:16,357 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-09-26 08:25:16,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:16,358 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:25:16,358 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:25:16,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:25:16,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:25:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:25:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:25:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:25:16,368 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2018-09-26 08:25:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:16,369 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:25:16,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:25:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:25:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:25:16,370 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:16,370 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1] [2018-09-26 08:25:16,370 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:16,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1786329594, now seen corresponding path program 18 times [2018-09-26 08:25:16,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:16,544 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:16,544 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:25:16,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:25:16,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:25:16,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:25:16,545 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 21 states. [2018-09-26 08:25:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:16,577 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:25:16,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:25:16,577 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-09-26 08:25:16,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:16,578 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:25:16,578 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:25:16,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:25:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:25:16,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-26 08:25:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:25:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 08:25:16,590 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2018-09-26 08:25:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:16,592 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 08:25:16,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:25:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 08:25:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:25:16,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:16,594 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1] [2018-09-26 08:25:16,594 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:16,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:16,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1899835435, now seen corresponding path program 19 times [2018-09-26 08:25:16,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:16,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:16,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:25:16,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:25:16,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:25:16,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:25:16,750 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 22 states. [2018-09-26 08:25:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:16,786 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:25:16,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:25:16,787 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-09-26 08:25:16,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:16,788 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:25:16,788 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:25:16,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:25:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:25:16,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:25:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:25:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:25:16,795 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2018-09-26 08:25:16,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:16,796 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:25:16,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:25:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:25:16,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:25:16,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:16,797 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1] [2018-09-26 08:25:16,797 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:16,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:16,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1081884582, now seen corresponding path program 20 times [2018-09-26 08:25:16,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:16,946 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:16,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:25:16,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:25:16,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:25:16,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:25:16,948 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 23 states. [2018-09-26 08:25:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:16,988 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:25:16,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:25:16,988 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-09-26 08:25:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:16,989 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:25:16,989 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:25:16,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:25:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:25:16,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-09-26 08:25:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:25:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-26 08:25:16,996 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2018-09-26 08:25:16,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:16,997 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-26 08:25:16,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:25:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-26 08:25:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:25:16,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:16,999 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1] [2018-09-26 08:25:16,999 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:16,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:17,000 INFO L82 PathProgramCache]: Analyzing trace with hash 989295157, now seen corresponding path program 21 times [2018-09-26 08:25:17,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:17,157 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:17,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:25:17,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:25:17,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:25:17,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:25:17,159 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 24 states. [2018-09-26 08:25:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:17,208 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:25:17,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:25:17,209 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-09-26 08:25:17,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:17,210 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:25:17,210 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:25:17,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:25:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:25:17,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:25:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:25:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:25:17,219 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2018-09-26 08:25:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:17,220 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:25:17,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:25:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:25:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:25:17,221 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:17,221 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1] [2018-09-26 08:25:17,221 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:17,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:17,222 INFO L82 PathProgramCache]: Analyzing trace with hash 26739014, now seen corresponding path program 22 times [2018-09-26 08:25:17,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:17,440 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:17,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:25:17,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:25:17,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:25:17,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:25:17,442 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 25 states. [2018-09-26 08:25:17,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:17,486 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:25:17,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:25:17,486 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 70 [2018-09-26 08:25:17,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:17,487 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:25:17,487 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:25:17,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:25:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:25:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 08:25:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:25:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-26 08:25:17,498 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2018-09-26 08:25:17,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:17,498 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-26 08:25:17,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:25:17,499 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-26 08:25:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:25:17,499 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:17,503 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1] [2018-09-26 08:25:17,503 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:17,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:17,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2013318293, now seen corresponding path program 23 times [2018-09-26 08:25:17,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:17,656 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:17,656 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:25:17,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:25:17,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:25:17,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:25:17,658 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 26 states. [2018-09-26 08:25:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:17,693 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:25:17,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:25:17,693 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2018-09-26 08:25:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:17,694 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:25:17,694 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:25:17,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:25:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:25:17,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:25:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:25:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:25:17,700 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2018-09-26 08:25:17,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:17,700 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:25:17,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:25:17,700 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:25:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:25:17,701 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:17,701 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1] [2018-09-26 08:25:17,701 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:17,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:17,702 INFO L82 PathProgramCache]: Analyzing trace with hash -452719898, now seen corresponding path program 24 times [2018-09-26 08:25:17,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:17,863 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:17,863 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:25:17,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:25:17,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:25:17,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:25:17,865 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 27 states. [2018-09-26 08:25:17,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:17,902 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:25:17,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:25:17,902 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-09-26 08:25:17,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:17,903 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:25:17,903 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:25:17,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:25:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:25:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 08:25:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:25:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-26 08:25:17,909 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2018-09-26 08:25:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:17,909 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-26 08:25:17,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:25:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-26 08:25:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:25:17,910 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:17,910 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1] [2018-09-26 08:25:17,910 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:17,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:17,911 INFO L82 PathProgramCache]: Analyzing trace with hash -780869899, now seen corresponding path program 25 times [2018-09-26 08:25:17,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:18,076 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:18,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:25:18,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:25:18,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:25:18,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:25:18,077 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 28 states. [2018-09-26 08:25:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:18,114 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:25:18,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:25:18,114 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-09-26 08:25:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:18,115 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:25:18,115 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:25:18,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:25:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:25:18,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:25:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:25:18,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:25:18,122 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2018-09-26 08:25:18,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:18,122 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:25:18,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:25:18,122 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:25:18,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:25:18,123 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:18,123 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1] [2018-09-26 08:25:18,123 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:18,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:18,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1351983994, now seen corresponding path program 26 times [2018-09-26 08:25:18,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:18,294 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:18,294 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:25:18,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:25:18,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:25:18,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:25:18,296 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 29 states. [2018-09-26 08:25:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:18,339 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:25:18,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:25:18,339 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2018-09-26 08:25:18,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:18,340 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:25:18,340 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:25:18,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:25:18,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:25:18,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-26 08:25:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:25:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:25:18,345 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2018-09-26 08:25:18,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:18,346 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:25:18,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:25:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:25:18,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:25:18,349 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:18,349 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1] [2018-09-26 08:25:18,349 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:18,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:18,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1248438613, now seen corresponding path program 27 times [2018-09-26 08:25:18,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:18,526 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:18,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:25:18,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:25:18,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:25:18,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:25:18,528 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 30 states. [2018-09-26 08:25:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:18,565 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:25:18,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:25:18,565 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2018-09-26 08:25:18,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:18,566 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:25:18,566 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:25:18,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:25:18,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:25:18,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:25:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:25:18,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:25:18,572 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2018-09-26 08:25:18,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:18,573 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:25:18,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:25:18,573 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:25:18,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:25:18,574 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:18,574 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1] [2018-09-26 08:25:18,574 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:18,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:18,575 INFO L82 PathProgramCache]: Analyzing trace with hash 2113205798, now seen corresponding path program 28 times [2018-09-26 08:25:18,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 0 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:18,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:18,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:25:18,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:25:18,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:25:18,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:25:18,750 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 31 states. [2018-09-26 08:25:18,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:18,790 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:25:18,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:25:18,791 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2018-09-26 08:25:18,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:18,792 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:25:18,792 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:25:18,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:25:18,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:25:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-26 08:25:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:25:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-26 08:25:18,799 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2018-09-26 08:25:18,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:18,800 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-26 08:25:18,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:25:18,800 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-26 08:25:18,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:25:18,801 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:18,801 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1] [2018-09-26 08:25:18,801 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:18,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:18,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1116394571, now seen corresponding path program 29 times [2018-09-26 08:25:18,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 0 proven. 1305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:19,017 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:19,017 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:25:19,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:25:19,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:25:19,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:25:19,019 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 32 states. [2018-09-26 08:25:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:19,061 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 08:25:19,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:25:19,061 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2018-09-26 08:25:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:19,062 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:25:19,062 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:25:19,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:25:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:25:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:25:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:25:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:25:19,069 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2018-09-26 08:25:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:19,070 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:25:19,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:25:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:25:19,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:25:19,071 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:19,071 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1] [2018-09-26 08:25:19,071 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:19,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:19,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1716377542, now seen corresponding path program 30 times [2018-09-26 08:25:19,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 1395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:19,324 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:19,324 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:25:19,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:25:19,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:25:19,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:25:19,326 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 33 states. [2018-09-26 08:25:19,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:19,383 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:25:19,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:25:19,384 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2018-09-26 08:25:19,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:19,385 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:25:19,385 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:25:19,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:25:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:25:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-26 08:25:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:25:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-26 08:25:19,394 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2018-09-26 08:25:19,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:19,394 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-26 08:25:19,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:25:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-26 08:25:19,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:25:19,396 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:19,396 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1] [2018-09-26 08:25:19,396 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:19,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:19,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1017996821, now seen corresponding path program 31 times [2018-09-26 08:25:19,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 0 proven. 1488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:19,673 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:19,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:25:19,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:25:19,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:25:19,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:25:19,675 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 34 states. [2018-09-26 08:25:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:19,718 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-26 08:25:19,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:25:19,718 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 97 [2018-09-26 08:25:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:19,719 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:25:19,719 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:25:19,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:25:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:25:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:25:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:25:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:25:19,727 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2018-09-26 08:25:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:19,728 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:25:19,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:25:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:25:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:25:19,729 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:19,729 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1] [2018-09-26 08:25:19,729 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:19,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:19,730 INFO L82 PathProgramCache]: Analyzing trace with hash 379519334, now seen corresponding path program 32 times [2018-09-26 08:25:19,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 0 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:19,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:19,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:25:19,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:25:19,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:25:19,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:25:19,934 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 35 states. [2018-09-26 08:25:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:19,975 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:25:19,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:25:19,975 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2018-09-26 08:25:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:19,976 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:25:19,976 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:25:19,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:25:19,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:25:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 08:25:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:25:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-26 08:25:19,984 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2018-09-26 08:25:19,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:19,984 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-26 08:25:19,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:25:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-26 08:25:19,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:25:19,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:19,986 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1] [2018-09-26 08:25:19,986 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:19,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:19,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1906858101, now seen corresponding path program 33 times [2018-09-26 08:25:19,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:20,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:20,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:25:20,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:25:20,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:25:20,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:25:20,190 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 36 states. [2018-09-26 08:25:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:20,231 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-09-26 08:25:20,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:25:20,231 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2018-09-26 08:25:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:20,232 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:25:20,232 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:25:20,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:25:20,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:25:20,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:25:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:25:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:25:20,238 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2018-09-26 08:25:20,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:20,239 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:25:20,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:25:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:25:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:25:20,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:20,240 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1] [2018-09-26 08:25:20,240 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:20,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:20,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1972531974, now seen corresponding path program 34 times [2018-09-26 08:25:20,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 0 proven. 1785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:20,461 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:20,461 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:25:20,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:25:20,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:25:20,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:25:20,463 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 37 states. [2018-09-26 08:25:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:20,512 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 08:25:20,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:25:20,513 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 106 [2018-09-26 08:25:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:20,514 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:25:20,514 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 08:25:20,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:25:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 08:25:20,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-09-26 08:25:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-26 08:25:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-09-26 08:25:20,521 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2018-09-26 08:25:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:20,521 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-09-26 08:25:20,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:25:20,521 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-09-26 08:25:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-26 08:25:20,522 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:20,523 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1] [2018-09-26 08:25:20,523 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:20,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:20,523 INFO L82 PathProgramCache]: Analyzing trace with hash -42204459, now seen corresponding path program 35 times [2018-09-26 08:25:20,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 0 proven. 1890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:20,742 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:20,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:25:20,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:25:20,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:25:20,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:25:20,744 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 38 states. [2018-09-26 08:25:20,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:20,787 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-09-26 08:25:20,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:25:20,787 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2018-09-26 08:25:20,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:20,788 INFO L225 Difference]: With dead ends: 114 [2018-09-26 08:25:20,788 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:25:20,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:25:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:25:20,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:25:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:25:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:25:20,795 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2018-09-26 08:25:20,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:20,795 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:25:20,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:25:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:25:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:25:20,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:20,797 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1] [2018-09-26 08:25:20,797 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:20,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:20,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1112681638, now seen corresponding path program 36 times [2018-09-26 08:25:20,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 0 proven. 1998 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:21,015 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:21,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:25:21,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:25:21,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:25:21,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:25:21,017 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 39 states. [2018-09-26 08:25:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:21,067 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-09-26 08:25:21,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:25:21,068 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 112 [2018-09-26 08:25:21,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:21,069 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:25:21,069 INFO L226 Difference]: Without dead ends: 116 [2018-09-26 08:25:21,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:25:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-26 08:25:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-09-26 08:25:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-26 08:25:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-26 08:25:21,076 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 112 [2018-09-26 08:25:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:21,077 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-26 08:25:21,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:25:21,077 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-26 08:25:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-26 08:25:21,078 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:21,078 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1] [2018-09-26 08:25:21,078 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:21,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:21,079 INFO L82 PathProgramCache]: Analyzing trace with hash -658610891, now seen corresponding path program 37 times [2018-09-26 08:25:21,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 0 proven. 2109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:21,308 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:21,308 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:25:21,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:25:21,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:25:21,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:25:21,310 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 40 states. [2018-09-26 08:25:21,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:21,364 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-26 08:25:21,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:25:21,365 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 115 [2018-09-26 08:25:21,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:21,366 INFO L225 Difference]: With dead ends: 120 [2018-09-26 08:25:21,366 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:25:21,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:25:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:25:21,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:25:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:25:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-09-26 08:25:21,373 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 115 [2018-09-26 08:25:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:21,374 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-09-26 08:25:21,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:25:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-09-26 08:25:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:25:21,375 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:21,375 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1] [2018-09-26 08:25:21,375 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:21,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:21,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1266143674, now seen corresponding path program 38 times [2018-09-26 08:25:21,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 0 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:21,673 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:21,674 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:25:21,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:25:21,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:25:21,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:25:21,676 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 41 states. [2018-09-26 08:25:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:21,740 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-26 08:25:21,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:25:21,740 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 118 [2018-09-26 08:25:21,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:21,742 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:25:21,742 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 08:25:21,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:25:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 08:25:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-09-26 08:25:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-26 08:25:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-09-26 08:25:21,751 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 118 [2018-09-26 08:25:21,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:21,751 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-09-26 08:25:21,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:25:21,751 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-09-26 08:25:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-26 08:25:21,753 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:21,753 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1] [2018-09-26 08:25:21,754 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:21,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:21,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1283096683, now seen corresponding path program 39 times [2018-09-26 08:25:21,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:22,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 0 proven. 2340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:22,065 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:22,065 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:25:22,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:25:22,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:25:22,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:25:22,067 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 42 states. [2018-09-26 08:25:22,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:22,122 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-09-26 08:25:22,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:25:22,122 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2018-09-26 08:25:22,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:22,124 INFO L225 Difference]: With dead ends: 126 [2018-09-26 08:25:22,124 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:25:22,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:25:22,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:25:22,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:25:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:25:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 08:25:22,131 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 121 [2018-09-26 08:25:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:22,131 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 08:25:22,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:25:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 08:25:22,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:25:22,133 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:22,133 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1] [2018-09-26 08:25:22,133 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:22,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:22,133 INFO L82 PathProgramCache]: Analyzing trace with hash 475953126, now seen corresponding path program 40 times [2018-09-26 08:25:22,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 0 proven. 2460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:22,388 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:22,388 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:25:22,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:25:22,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:25:22,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:25:22,390 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 43 states. [2018-09-26 08:25:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:22,446 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-09-26 08:25:22,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:25:22,446 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 124 [2018-09-26 08:25:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:22,447 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:25:22,447 INFO L226 Difference]: Without dead ends: 128 [2018-09-26 08:25:22,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:25:22,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-09-26 08:25:22,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-09-26 08:25:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-09-26 08:25:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-09-26 08:25:22,455 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 124 [2018-09-26 08:25:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:22,455 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-09-26 08:25:22,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:25:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-09-26 08:25:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-09-26 08:25:22,456 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:22,457 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1] [2018-09-26 08:25:22,457 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:22,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:22,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1432834549, now seen corresponding path program 41 times [2018-09-26 08:25:22,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 0 proven. 2583 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:22,704 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:22,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:25:22,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:25:22,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:25:22,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:25:22,706 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 44 states. [2018-09-26 08:25:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:22,755 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-09-26 08:25:22,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:25:22,756 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 127 [2018-09-26 08:25:22,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:22,757 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:25:22,757 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:25:22,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:25:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:25:22,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:25:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:25:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:25:22,765 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 127 [2018-09-26 08:25:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:22,766 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:25:22,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:25:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:25:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:25:22,767 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:22,767 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1] [2018-09-26 08:25:22,767 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:22,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:22,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2105603706, now seen corresponding path program 42 times [2018-09-26 08:25:22,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 0 proven. 2709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:23,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:23,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:25:23,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:25:23,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:25:23,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:25:23,052 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 45 states. [2018-09-26 08:25:23,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:23,106 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 08:25:23,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:25:23,106 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 130 [2018-09-26 08:25:23,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:23,107 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:25:23,107 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 08:25:23,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:25:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 08:25:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-09-26 08:25:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-26 08:25:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-09-26 08:25:23,118 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 130 [2018-09-26 08:25:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:23,118 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-09-26 08:25:23,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:25:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-09-26 08:25:23,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-26 08:25:23,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:23,121 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 1, 1] [2018-09-26 08:25:23,121 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:23,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:23,121 INFO L82 PathProgramCache]: Analyzing trace with hash -42345387, now seen corresponding path program 43 times [2018-09-26 08:25:23,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:23,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 0 proven. 2838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:23,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:23,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:25:23,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:25:23,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:25:23,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:25:23,405 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 46 states. [2018-09-26 08:25:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:23,456 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-09-26 08:25:23,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:25:23,457 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 133 [2018-09-26 08:25:23,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:23,458 INFO L225 Difference]: With dead ends: 138 [2018-09-26 08:25:23,458 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:25:23,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:25:23,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:25:23,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:25:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:25:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 08:25:23,466 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 133 [2018-09-26 08:25:23,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:23,466 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 08:25:23,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:25:23,466 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 08:25:23,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:25:23,468 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:23,468 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 1, 1] [2018-09-26 08:25:23,468 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:23,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:23,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1209262886, now seen corresponding path program 44 times [2018-09-26 08:25:23,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:23,768 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:23,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:25:23,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:25:23,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:25:23,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:25:23,770 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 47 states. [2018-09-26 08:25:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:23,835 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-09-26 08:25:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:25:23,836 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 136 [2018-09-26 08:25:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:23,837 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:25:23,837 INFO L226 Difference]: Without dead ends: 140 [2018-09-26 08:25:23,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:25:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-26 08:25:23,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-09-26 08:25:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-09-26 08:25:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-09-26 08:25:23,845 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 136 [2018-09-26 08:25:23,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:23,846 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-09-26 08:25:23,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:25:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-09-26 08:25:23,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-26 08:25:23,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:23,848 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 1, 1] [2018-09-26 08:25:23,848 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:23,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:23,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1034740043, now seen corresponding path program 45 times [2018-09-26 08:25:23,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:24,204 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:24,204 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:25:24,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:25:24,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:25:24,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:25:24,206 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 48 states. [2018-09-26 08:25:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:24,268 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-09-26 08:25:24,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:25:24,268 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2018-09-26 08:25:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:24,269 INFO L225 Difference]: With dead ends: 144 [2018-09-26 08:25:24,270 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:25:24,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:25:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:25:24,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:25:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:25:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-09-26 08:25:24,281 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 139 [2018-09-26 08:25:24,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:24,282 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-09-26 08:25:24,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:25:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-09-26 08:25:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:25:24,284 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:24,284 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 1, 1] [2018-09-26 08:25:24,284 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:24,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:24,285 INFO L82 PathProgramCache]: Analyzing trace with hash -960035642, now seen corresponding path program 46 times [2018-09-26 08:25:24,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 3243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:24,606 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:24,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:25:24,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:25:24,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:25:24,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:25:24,608 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 49 states. [2018-09-26 08:25:24,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:24,680 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-26 08:25:24,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:25:24,681 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 142 [2018-09-26 08:25:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:24,682 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:25:24,682 INFO L226 Difference]: Without dead ends: 146 [2018-09-26 08:25:24,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:25:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-26 08:25:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-09-26 08:25:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 08:25:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-26 08:25:24,689 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 142 [2018-09-26 08:25:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:24,690 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-26 08:25:24,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:25:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-26 08:25:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-26 08:25:24,692 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:24,692 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 1, 1] [2018-09-26 08:25:24,692 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:24,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:24,692 INFO L82 PathProgramCache]: Analyzing trace with hash -234284779, now seen corresponding path program 47 times [2018-09-26 08:25:24,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 0 proven. 3384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:24,974 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:24,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:25:24,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:25:24,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:25:24,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:25:24,976 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 50 states. [2018-09-26 08:25:25,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:25,048 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-26 08:25:25,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:25:25,048 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 145 [2018-09-26 08:25:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:25,050 INFO L225 Difference]: With dead ends: 150 [2018-09-26 08:25:25,050 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:25:25,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:25:25,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:25:25,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:25:25,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:25:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 08:25:25,059 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 145 [2018-09-26 08:25:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:25,060 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 08:25:25,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:25:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 08:25:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:25:25,061 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:25,062 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 1, 1] [2018-09-26 08:25:25,062 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:25,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:25,062 INFO L82 PathProgramCache]: Analyzing trace with hash -255693210, now seen corresponding path program 48 times [2018-09-26 08:25:25,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:25,379 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:25,379 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:25:25,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:25:25,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:25:25,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:25:25,383 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 51 states. [2018-09-26 08:25:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:25,454 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-09-26 08:25:25,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:25:25,455 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 148 [2018-09-26 08:25:25,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:25,456 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:25:25,456 INFO L226 Difference]: Without dead ends: 152 [2018-09-26 08:25:25,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:25:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-09-26 08:25:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-09-26 08:25:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-26 08:25:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-09-26 08:25:25,465 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 148 [2018-09-26 08:25:25,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:25,465 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-09-26 08:25:25,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:25:25,466 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-09-26 08:25:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-26 08:25:25,468 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:25,468 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 1, 1] [2018-09-26 08:25:25,468 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:25,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:25,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1915865973, now seen corresponding path program 49 times [2018-09-26 08:25:25,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 0 proven. 3675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:25,802 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:25,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:25:25,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:25:25,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:25:25,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:25:25,804 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 52 states. [2018-09-26 08:25:25,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:25,866 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-09-26 08:25:25,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:25:25,866 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 151 [2018-09-26 08:25:25,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:25,867 INFO L225 Difference]: With dead ends: 156 [2018-09-26 08:25:25,867 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:25:25,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:25:25,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:25:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:25:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:25:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-09-26 08:25:25,877 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 151 [2018-09-26 08:25:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:25,877 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-09-26 08:25:25,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:25:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-09-26 08:25:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:25:25,879 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:25,879 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 1, 1] [2018-09-26 08:25:25,880 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:25,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:25,880 INFO L82 PathProgramCache]: Analyzing trace with hash -256892922, now seen corresponding path program 50 times [2018-09-26 08:25:25,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 0 proven. 3825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:26,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:26,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:25:26,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:25:26,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:25:26,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:25:26,217 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 53 states. [2018-09-26 08:25:26,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:26,313 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-26 08:25:26,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:25:26,313 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 154 [2018-09-26 08:25:26,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:26,314 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:25:26,314 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 08:25:26,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:25:26,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 08:25:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-09-26 08:25:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-09-26 08:25:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-09-26 08:25:26,326 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 154 [2018-09-26 08:25:26,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:26,327 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-09-26 08:25:26,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:25:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-09-26 08:25:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-26 08:25:26,328 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:26,329 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 1, 1] [2018-09-26 08:25:26,329 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:26,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:26,329 INFO L82 PathProgramCache]: Analyzing trace with hash 534984149, now seen corresponding path program 51 times [2018-09-26 08:25:26,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 0 proven. 3978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:26,663 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:26,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:25:26,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:25:26,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:25:26,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:25:26,665 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 54 states. [2018-09-26 08:25:26,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:26,748 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-09-26 08:25:26,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:25:26,748 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 157 [2018-09-26 08:25:26,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:26,750 INFO L225 Difference]: With dead ends: 162 [2018-09-26 08:25:26,750 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:25:26,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:25:26,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:25:26,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-26 08:25:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:25:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 08:25:26,759 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 157 [2018-09-26 08:25:26,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:26,759 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 08:25:26,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:25:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 08:25:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:25:26,761 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:26,762 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 1, 1] [2018-09-26 08:25:26,762 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:26,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:26,762 INFO L82 PathProgramCache]: Analyzing trace with hash -910550618, now seen corresponding path program 52 times [2018-09-26 08:25:26,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 0 proven. 4134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:27,094 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:27,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:25:27,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:25:27,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:25:27,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:25:27,096 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 55 states. [2018-09-26 08:25:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:27,172 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-26 08:25:27,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:25:27,172 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 160 [2018-09-26 08:25:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:27,173 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:25:27,174 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 08:25:27,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:25:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 08:25:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-09-26 08:25:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-09-26 08:25:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-09-26 08:25:27,186 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 160 [2018-09-26 08:25:27,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:27,186 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-09-26 08:25:27,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:25:27,187 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-09-26 08:25:27,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-26 08:25:27,188 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:27,188 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 1, 1] [2018-09-26 08:25:27,189 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:27,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:27,189 INFO L82 PathProgramCache]: Analyzing trace with hash 800282677, now seen corresponding path program 53 times [2018-09-26 08:25:27,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 0 proven. 4293 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:27,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:27,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:25:27,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:25:27,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:25:27,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:25:27,509 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 56 states. [2018-09-26 08:25:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:27,594 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-09-26 08:25:27,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:25:27,594 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 163 [2018-09-26 08:25:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:27,595 INFO L225 Difference]: With dead ends: 168 [2018-09-26 08:25:27,596 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:25:27,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:25:27,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:25:27,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-26 08:25:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:25:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-26 08:25:27,604 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 163 [2018-09-26 08:25:27,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:27,604 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-26 08:25:27,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:25:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-26 08:25:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:25:27,606 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:27,606 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 1, 1] [2018-09-26 08:25:27,606 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:27,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:27,607 INFO L82 PathProgramCache]: Analyzing trace with hash -141927610, now seen corresponding path program 54 times [2018-09-26 08:25:27,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 0 proven. 4455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:27,940 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:27,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:25:27,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:25:27,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:25:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:25:27,942 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 57 states. [2018-09-26 08:25:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:28,027 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-26 08:25:28,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:25:28,027 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 166 [2018-09-26 08:25:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:28,028 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:25:28,029 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 08:25:28,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:25:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 08:25:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-09-26 08:25:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-09-26 08:25:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-09-26 08:25:28,036 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 166 [2018-09-26 08:25:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:28,036 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-09-26 08:25:28,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:25:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-09-26 08:25:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-26 08:25:28,038 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:28,038 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 1, 1] [2018-09-26 08:25:28,038 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:28,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:28,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1917308267, now seen corresponding path program 55 times [2018-09-26 08:25:28,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 0 proven. 4620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:28,373 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:28,373 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:25:28,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:25:28,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:25:28,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:25:28,374 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 58 states. [2018-09-26 08:25:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:28,450 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-09-26 08:25:28,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:25:28,451 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 169 [2018-09-26 08:25:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:28,452 INFO L225 Difference]: With dead ends: 174 [2018-09-26 08:25:28,452 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:25:28,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:25:28,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:25:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-09-26 08:25:28,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:25:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-26 08:25:28,459 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 169 [2018-09-26 08:25:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:28,459 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-26 08:25:28,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:25:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-26 08:25:28,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:25:28,460 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:28,460 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 1, 1] [2018-09-26 08:25:28,461 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:28,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash 239789286, now seen corresponding path program 56 times [2018-09-26 08:25:28,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 0 proven. 4788 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:28,994 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:28,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:25:28,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:25:28,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:25:28,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:25:28,996 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 59 states. [2018-09-26 08:25:29,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:29,070 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-09-26 08:25:29,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:25:29,070 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 172 [2018-09-26 08:25:29,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:29,072 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:25:29,073 INFO L226 Difference]: Without dead ends: 176 [2018-09-26 08:25:29,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:25:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-09-26 08:25:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-09-26 08:25:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-26 08:25:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-09-26 08:25:29,080 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 172 [2018-09-26 08:25:29,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:29,080 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-09-26 08:25:29,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:25:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-09-26 08:25:29,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-26 08:25:29,081 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:29,081 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 1, 1] [2018-09-26 08:25:29,082 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:29,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:29,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1032307957, now seen corresponding path program 57 times [2018-09-26 08:25:29,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 0 proven. 4959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:29,447 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:29,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:25:29,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:25:29,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:25:29,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:25:29,449 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 60 states. [2018-09-26 08:25:29,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:29,516 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-09-26 08:25:29,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:25:29,516 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 175 [2018-09-26 08:25:29,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:29,517 INFO L225 Difference]: With dead ends: 180 [2018-09-26 08:25:29,517 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:25:29,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:25:29,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:25:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-09-26 08:25:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:25:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-09-26 08:25:29,526 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 175 [2018-09-26 08:25:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:29,527 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-09-26 08:25:29,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:25:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-09-26 08:25:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:25:29,528 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:29,528 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 1, 1] [2018-09-26 08:25:29,528 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:29,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:29,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1520809606, now seen corresponding path program 58 times [2018-09-26 08:25:29,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 0 proven. 5133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:29,886 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:29,886 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:25:29,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:25:29,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:25:29,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:25:29,887 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 61 states. [2018-09-26 08:25:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:29,959 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-26 08:25:29,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:25:29,959 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 178 [2018-09-26 08:25:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:29,961 INFO L225 Difference]: With dead ends: 183 [2018-09-26 08:25:29,961 INFO L226 Difference]: Without dead ends: 182 [2018-09-26 08:25:29,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:25:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-26 08:25:29,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-09-26 08:25:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-26 08:25:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-09-26 08:25:29,968 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 178 [2018-09-26 08:25:29,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:29,968 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-09-26 08:25:29,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:25:29,969 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-09-26 08:25:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-26 08:25:29,969 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:29,970 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 1, 1] [2018-09-26 08:25:29,970 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:29,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:29,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1170731179, now seen corresponding path program 59 times [2018-09-26 08:25:29,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 0 proven. 5310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:30,304 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:30,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:25:30,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:25:30,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:25:30,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:25:30,306 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 62 states. [2018-09-26 08:25:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:30,410 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-09-26 08:25:30,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:25:30,410 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 181 [2018-09-26 08:25:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:30,412 INFO L225 Difference]: With dead ends: 186 [2018-09-26 08:25:30,412 INFO L226 Difference]: Without dead ends: 185 [2018-09-26 08:25:30,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:25:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-26 08:25:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-09-26 08:25:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:25:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-26 08:25:30,419 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 181 [2018-09-26 08:25:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:30,419 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-26 08:25:30,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:25:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-26 08:25:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:25:30,420 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:30,420 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 1, 1] [2018-09-26 08:25:30,421 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:30,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:30,421 INFO L82 PathProgramCache]: Analyzing trace with hash -2117808090, now seen corresponding path program 60 times [2018-09-26 08:25:30,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5490 backedges. 0 proven. 5490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:30,866 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:30,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:25:30,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:25:30,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:25:30,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:25:30,868 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 63 states. [2018-09-26 08:25:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:30,978 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-09-26 08:25:30,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:25:30,978 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 184 [2018-09-26 08:25:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:30,980 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:25:30,980 INFO L226 Difference]: Without dead ends: 188 [2018-09-26 08:25:30,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:25:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-09-26 08:25:30,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-09-26 08:25:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-09-26 08:25:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-09-26 08:25:30,988 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 184 [2018-09-26 08:25:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:30,988 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-09-26 08:25:30,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:25:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-09-26 08:25:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-26 08:25:30,990 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:30,990 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 1, 1] [2018-09-26 08:25:30,990 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:30,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1449071029, now seen corresponding path program 61 times [2018-09-26 08:25:30,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 0 proven. 5673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:31,435 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:31,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:25:31,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:25:31,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:25:31,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:25:31,438 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 64 states. [2018-09-26 08:25:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:31,509 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-09-26 08:25:31,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:25:31,510 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 187 [2018-09-26 08:25:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:31,511 INFO L225 Difference]: With dead ends: 192 [2018-09-26 08:25:31,511 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:25:31,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:25:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:25:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-26 08:25:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:25:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-26 08:25:31,518 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 187 [2018-09-26 08:25:31,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:31,518 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-26 08:25:31,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:25:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-26 08:25:31,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:25:31,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:31,520 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 1, 1] [2018-09-26 08:25:31,520 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:31,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:31,520 INFO L82 PathProgramCache]: Analyzing trace with hash 559034822, now seen corresponding path program 62 times [2018-09-26 08:25:31,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 0 proven. 5859 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:31,921 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:31,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:25:31,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:25:31,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:25:31,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:25:31,925 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 65 states. [2018-09-26 08:25:32,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:32,031 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-26 08:25:32,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:25:32,031 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 190 [2018-09-26 08:25:32,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:32,033 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:25:32,033 INFO L226 Difference]: Without dead ends: 194 [2018-09-26 08:25:32,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:25:32,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-26 08:25:32,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-09-26 08:25:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-26 08:25:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-09-26 08:25:32,043 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 190 [2018-09-26 08:25:32,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:32,043 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-09-26 08:25:32,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:25:32,043 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-09-26 08:25:32,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-09-26 08:25:32,044 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:32,044 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 1, 1] [2018-09-26 08:25:32,045 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:32,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:32,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1676489707, now seen corresponding path program 63 times [2018-09-26 08:25:32,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 0 proven. 6048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:32,446 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:32,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:25:32,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:25:32,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:25:32,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:25:32,449 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 66 states. [2018-09-26 08:25:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:32,513 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-09-26 08:25:32,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:25:32,514 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 193 [2018-09-26 08:25:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:32,515 INFO L225 Difference]: With dead ends: 198 [2018-09-26 08:25:32,515 INFO L226 Difference]: Without dead ends: 197 [2018-09-26 08:25:32,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:25:32,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-26 08:25:32,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-09-26 08:25:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:25:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-26 08:25:32,522 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 193 [2018-09-26 08:25:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:32,522 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-26 08:25:32,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:25:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-26 08:25:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:25:32,523 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:32,524 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 1, 1] [2018-09-26 08:25:32,524 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:32,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:32,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1870125926, now seen corresponding path program 64 times [2018-09-26 08:25:32,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:32,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6240 backedges. 0 proven. 6240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:32,917 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:32,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:25:32,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:25:32,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:25:32,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:25:32,920 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 67 states. [2018-09-26 08:25:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:33,036 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-09-26 08:25:33,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:25:33,036 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 196 [2018-09-26 08:25:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:33,037 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:25:33,037 INFO L226 Difference]: Without dead ends: 200 [2018-09-26 08:25:33,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:25:33,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-26 08:25:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-09-26 08:25:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-26 08:25:33,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-09-26 08:25:33,044 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 196 [2018-09-26 08:25:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:33,045 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-09-26 08:25:33,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:25:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-09-26 08:25:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-26 08:25:33,046 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:33,046 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 1, 1] [2018-09-26 08:25:33,046 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:33,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:33,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1394000267, now seen corresponding path program 65 times [2018-09-26 08:25:33,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:33,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 0 proven. 6435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:33,482 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:33,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:25:33,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:25:33,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:25:33,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:25:33,484 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 68 states. [2018-09-26 08:25:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:33,599 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-09-26 08:25:33,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:25:33,600 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 199 [2018-09-26 08:25:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:33,601 INFO L225 Difference]: With dead ends: 204 [2018-09-26 08:25:33,601 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:25:33,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:25:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:25:33,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-09-26 08:25:33,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:25:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-09-26 08:25:33,610 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 199 [2018-09-26 08:25:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:33,610 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-09-26 08:25:33,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:25:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-09-26 08:25:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:25:33,612 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:33,612 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 1, 1] [2018-09-26 08:25:33,612 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:33,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:33,613 INFO L82 PathProgramCache]: Analyzing trace with hash -622867194, now seen corresponding path program 66 times [2018-09-26 08:25:33,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 0 proven. 6633 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:34,210 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:34,210 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:25:34,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:25:34,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:25:34,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:25:34,212 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 69 states. [2018-09-26 08:25:34,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:34,338 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-26 08:25:34,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:25:34,338 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 202 [2018-09-26 08:25:34,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:34,340 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:25:34,340 INFO L226 Difference]: Without dead ends: 206 [2018-09-26 08:25:34,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:25:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-26 08:25:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-09-26 08:25:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-26 08:25:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-09-26 08:25:34,346 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 202 [2018-09-26 08:25:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:34,346 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-09-26 08:25:34,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:25:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-09-26 08:25:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-26 08:25:34,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:34,348 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 1, 1] [2018-09-26 08:25:34,348 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:34,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:34,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1577555755, now seen corresponding path program 67 times [2018-09-26 08:25:34,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 0 proven. 6834 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:34,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:34,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:25:34,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:25:34,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:25:34,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:25:34,756 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 70 states. [2018-09-26 08:25:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:34,895 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-09-26 08:25:34,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:25:34,896 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 205 [2018-09-26 08:25:34,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:34,897 INFO L225 Difference]: With dead ends: 210 [2018-09-26 08:25:34,897 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 08:25:34,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:25:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 08:25:34,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-09-26 08:25:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 08:25:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-26 08:25:34,904 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 205 [2018-09-26 08:25:34,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:34,904 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-26 08:25:34,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:25:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-26 08:25:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:25:34,906 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:34,906 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 1, 1] [2018-09-26 08:25:34,906 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:34,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:34,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1431042394, now seen corresponding path program 68 times [2018-09-26 08:25:34,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 0 proven. 7038 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:35,304 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:35,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:25:35,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:25:35,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:25:35,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:25:35,306 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 71 states. [2018-09-26 08:25:35,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:35,412 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-09-26 08:25:35,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:25:35,413 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 208 [2018-09-26 08:25:35,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:35,414 INFO L225 Difference]: With dead ends: 213 [2018-09-26 08:25:35,414 INFO L226 Difference]: Without dead ends: 212 [2018-09-26 08:25:35,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:25:35,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-09-26 08:25:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-09-26 08:25:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-09-26 08:25:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-09-26 08:25:35,419 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 208 [2018-09-26 08:25:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:35,420 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-09-26 08:25:35,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:25:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-09-26 08:25:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-26 08:25:35,421 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:35,421 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 1, 1] [2018-09-26 08:25:35,422 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:35,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:35,422 INFO L82 PathProgramCache]: Analyzing trace with hash -338277579, now seen corresponding path program 69 times [2018-09-26 08:25:35,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 0 proven. 7245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:35,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:35,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:25:35,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:25:35,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:25:35,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:25:35,759 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 72 states. [2018-09-26 08:25:35,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:35,882 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-09-26 08:25:35,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:25:35,882 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 211 [2018-09-26 08:25:35,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:35,883 INFO L225 Difference]: With dead ends: 216 [2018-09-26 08:25:35,884 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 08:25:35,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:25:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 08:25:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-09-26 08:25:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-09-26 08:25:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-09-26 08:25:35,890 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 211 [2018-09-26 08:25:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:35,890 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-09-26 08:25:35,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:25:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-09-26 08:25:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-26 08:25:35,891 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:35,892 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 1, 1] [2018-09-26 08:25:35,892 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:35,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:35,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1633777594, now seen corresponding path program 70 times [2018-09-26 08:25:35,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 0 proven. 7455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:36,291 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:36,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:25:36,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:25:36,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:25:36,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:25:36,292 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 73 states. [2018-09-26 08:25:36,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:36,354 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-09-26 08:25:36,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:25:36,354 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 214 [2018-09-26 08:25:36,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:36,355 INFO L225 Difference]: With dead ends: 219 [2018-09-26 08:25:36,355 INFO L226 Difference]: Without dead ends: 218 [2018-09-26 08:25:36,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:25:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-26 08:25:36,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-09-26 08:25:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-09-26 08:25:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-09-26 08:25:36,362 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 214 [2018-09-26 08:25:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:36,362 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-09-26 08:25:36,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:25:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-09-26 08:25:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-26 08:25:36,364 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:36,364 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 1, 1] [2018-09-26 08:25:36,364 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:36,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:36,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1298602603, now seen corresponding path program 71 times [2018-09-26 08:25:36,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:36,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7668 backedges. 0 proven. 7668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:36,760 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:36,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:25:36,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:25:36,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:25:36,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:25:36,761 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 74 states. [2018-09-26 08:25:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:36,876 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-09-26 08:25:36,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:25:36,877 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 217 [2018-09-26 08:25:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:36,878 INFO L225 Difference]: With dead ends: 222 [2018-09-26 08:25:36,878 INFO L226 Difference]: Without dead ends: 221 [2018-09-26 08:25:36,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:25:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-26 08:25:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-09-26 08:25:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:25:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-26 08:25:36,886 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 217 [2018-09-26 08:25:36,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:36,886 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-26 08:25:36,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:25:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-26 08:25:36,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:25:36,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:36,888 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 1, 1] [2018-09-26 08:25:36,888 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:36,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:36,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1899408922, now seen corresponding path program 72 times [2018-09-26 08:25:36,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 0 proven. 7884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:37,298 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:37,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:25:37,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:25:37,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:25:37,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:25:37,300 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 75 states. [2018-09-26 08:25:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:37,369 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-09-26 08:25:37,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:25:37,369 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 220 [2018-09-26 08:25:37,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:37,371 INFO L225 Difference]: With dead ends: 225 [2018-09-26 08:25:37,371 INFO L226 Difference]: Without dead ends: 224 [2018-09-26 08:25:37,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:25:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-26 08:25:37,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-09-26 08:25:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-09-26 08:25:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-09-26 08:25:37,379 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 220 [2018-09-26 08:25:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:37,379 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-09-26 08:25:37,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:25:37,380 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-09-26 08:25:37,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-26 08:25:37,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:37,382 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 1, 1] [2018-09-26 08:25:37,382 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:37,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:37,383 INFO L82 PathProgramCache]: Analyzing trace with hash 903231477, now seen corresponding path program 73 times [2018-09-26 08:25:37,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8103 backedges. 0 proven. 8103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:37,807 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:37,808 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:25:37,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:25:37,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:25:37,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:25:37,809 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 76 states. [2018-09-26 08:25:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:37,970 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-09-26 08:25:37,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:25:37,970 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 223 [2018-09-26 08:25:37,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:37,972 INFO L225 Difference]: With dead ends: 228 [2018-09-26 08:25:37,972 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:25:37,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:25:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:25:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-09-26 08:25:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:25:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-09-26 08:25:37,980 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 223 [2018-09-26 08:25:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:37,981 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-09-26 08:25:37,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:25:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-09-26 08:25:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:25:37,982 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:37,982 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 1, 1] [2018-09-26 08:25:37,982 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:37,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:37,983 INFO L82 PathProgramCache]: Analyzing trace with hash 199123846, now seen corresponding path program 74 times [2018-09-26 08:25:37,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8325 backedges. 0 proven. 8325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:38,433 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:38,433 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:25:38,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:25:38,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:25:38,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:25:38,434 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 77 states. [2018-09-26 08:25:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:38,536 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-26 08:25:38,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:25:38,536 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 226 [2018-09-26 08:25:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:38,537 INFO L225 Difference]: With dead ends: 231 [2018-09-26 08:25:38,538 INFO L226 Difference]: Without dead ends: 230 [2018-09-26 08:25:38,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:25:38,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-26 08:25:38,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-09-26 08:25:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-09-26 08:25:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-09-26 08:25:38,570 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 226 [2018-09-26 08:25:38,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:38,571 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-09-26 08:25:38,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:25:38,571 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-09-26 08:25:38,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-09-26 08:25:38,572 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:38,572 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 1, 1] [2018-09-26 08:25:38,572 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:38,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:38,575 INFO L82 PathProgramCache]: Analyzing trace with hash 748962389, now seen corresponding path program 75 times [2018-09-26 08:25:38,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8550 backedges. 0 proven. 8550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:38,946 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:38,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:25:38,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:25:38,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:25:38,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:25:38,948 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 78 states. [2018-09-26 08:25:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:39,016 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-09-26 08:25:39,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:25:39,016 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 229 [2018-09-26 08:25:39,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:39,018 INFO L225 Difference]: With dead ends: 234 [2018-09-26 08:25:39,018 INFO L226 Difference]: Without dead ends: 233 [2018-09-26 08:25:39,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:25:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-09-26 08:25:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-09-26 08:25:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:25:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-26 08:25:39,027 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 229 [2018-09-26 08:25:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:39,027 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-26 08:25:39,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:25:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-26 08:25:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 08:25:39,028 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:39,029 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 1, 1] [2018-09-26 08:25:39,029 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:39,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:39,029 INFO L82 PathProgramCache]: Analyzing trace with hash -16270042, now seen corresponding path program 76 times [2018-09-26 08:25:39,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:39,611 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-26 08:25:39,612 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:39,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:25:39,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:25:39,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:25:39,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:25:39,613 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 79 states. [2018-09-26 08:25:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:39,681 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-09-26 08:25:39,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:25:39,681 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 232 [2018-09-26 08:25:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:39,682 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:25:39,683 INFO L226 Difference]: Without dead ends: 236 [2018-09-26 08:25:39,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:25:39,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-09-26 08:25:39,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2018-09-26 08:25:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-26 08:25:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-09-26 08:25:39,689 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 232 [2018-09-26 08:25:39,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:39,689 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-09-26 08:25:39,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:25:39,689 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-09-26 08:25:39,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-26 08:25:39,690 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:39,690 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 77, 1, 1] [2018-09-26 08:25:39,690 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:39,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:39,690 INFO L82 PathProgramCache]: Analyzing trace with hash 630785205, now seen corresponding path program 77 times [2018-09-26 08:25:39,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9009 backedges. 0 proven. 9009 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:40,105 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:40,105 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:25:40,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:25:40,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:25:40,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:25:40,107 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 80 states. [2018-09-26 08:25:40,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:40,177 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-09-26 08:25:40,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:25:40,178 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 235 [2018-09-26 08:25:40,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:40,179 INFO L225 Difference]: With dead ends: 240 [2018-09-26 08:25:40,179 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 08:25:40,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:25:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 08:25:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-09-26 08:25:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-26 08:25:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-09-26 08:25:40,184 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 235 [2018-09-26 08:25:40,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:40,184 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-09-26 08:25:40,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:25:40,185 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-09-26 08:25:40,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-26 08:25:40,186 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:40,186 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 78, 1, 1] [2018-09-26 08:25:40,186 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:40,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:40,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1240424134, now seen corresponding path program 78 times [2018-09-26 08:25:40,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9243 backedges. 0 proven. 9243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:40,618 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:40,618 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:25:40,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:25:40,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:25:40,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:25:40,619 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 81 states. [2018-09-26 08:25:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:40,719 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-09-26 08:25:40,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:25:40,719 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 238 [2018-09-26 08:25:40,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:40,720 INFO L225 Difference]: With dead ends: 243 [2018-09-26 08:25:40,720 INFO L226 Difference]: Without dead ends: 242 [2018-09-26 08:25:40,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:25:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-26 08:25:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-09-26 08:25:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-09-26 08:25:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-09-26 08:25:40,728 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 238 [2018-09-26 08:25:40,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:40,728 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-09-26 08:25:40,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:25:40,728 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-09-26 08:25:40,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-09-26 08:25:40,730 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:40,730 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 79, 1, 1] [2018-09-26 08:25:40,730 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:40,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:40,731 INFO L82 PathProgramCache]: Analyzing trace with hash -422936811, now seen corresponding path program 79 times [2018-09-26 08:25:40,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9480 backedges. 0 proven. 9480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:41,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:41,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:25:41,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:25:41,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:25:41,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:25:41,202 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 82 states. [2018-09-26 08:25:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:41,333 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-09-26 08:25:41,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:25:41,333 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 241 [2018-09-26 08:25:41,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:41,334 INFO L225 Difference]: With dead ends: 246 [2018-09-26 08:25:41,334 INFO L226 Difference]: Without dead ends: 245 [2018-09-26 08:25:41,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:25:41,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-26 08:25:41,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-09-26 08:25:41,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 08:25:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-26 08:25:41,342 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 241 [2018-09-26 08:25:41,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:41,343 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-26 08:25:41,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:25:41,343 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-26 08:25:41,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-26 08:25:41,344 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:41,344 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 80, 1, 1] [2018-09-26 08:25:41,344 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:41,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:41,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1723811942, now seen corresponding path program 80 times [2018-09-26 08:25:41,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 0 proven. 9720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:41,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:41,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:25:41,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:25:41,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:25:41,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:25:41,758 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 83 states. [2018-09-26 08:25:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:41,910 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-09-26 08:25:41,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:25:41,910 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 244 [2018-09-26 08:25:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:41,912 INFO L225 Difference]: With dead ends: 249 [2018-09-26 08:25:41,912 INFO L226 Difference]: Without dead ends: 248 [2018-09-26 08:25:41,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:25:41,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-09-26 08:25:41,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-09-26 08:25:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-09-26 08:25:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-09-26 08:25:41,920 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 244 [2018-09-26 08:25:41,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:41,921 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-09-26 08:25:41,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:25:41,921 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-09-26 08:25:41,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-09-26 08:25:41,923 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:41,923 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 81, 1, 1] [2018-09-26 08:25:41,923 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:41,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:41,924 INFO L82 PathProgramCache]: Analyzing trace with hash -842092171, now seen corresponding path program 81 times [2018-09-26 08:25:41,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9963 backedges. 0 proven. 9963 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:42,335 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:42,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:25:42,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:25:42,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:25:42,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:25:42,336 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 84 states. [2018-09-26 08:25:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:42,405 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-09-26 08:25:42,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:25:42,405 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 247 [2018-09-26 08:25:42,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:42,406 INFO L225 Difference]: With dead ends: 252 [2018-09-26 08:25:42,406 INFO L226 Difference]: Without dead ends: 251 [2018-09-26 08:25:42,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:25:42,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-09-26 08:25:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-09-26 08:25:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-26 08:25:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-09-26 08:25:42,413 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2018-09-26 08:25:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:42,414 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-09-26 08:25:42,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:25:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-09-26 08:25:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-26 08:25:42,415 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:42,416 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 82, 1, 1] [2018-09-26 08:25:42,416 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:42,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:42,416 INFO L82 PathProgramCache]: Analyzing trace with hash 136411654, now seen corresponding path program 82 times [2018-09-26 08:25:42,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 0 proven. 10209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:42,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:42,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:25:42,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:25:42,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:25:42,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:25:42,984 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 85 states. [2018-09-26 08:25:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:43,166 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-26 08:25:43,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:25:43,166 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 250 [2018-09-26 08:25:43,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:43,167 INFO L225 Difference]: With dead ends: 255 [2018-09-26 08:25:43,167 INFO L226 Difference]: Without dead ends: 254 [2018-09-26 08:25:43,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:25:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-26 08:25:43,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-09-26 08:25:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-09-26 08:25:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-09-26 08:25:43,175 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 250 [2018-09-26 08:25:43,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:43,175 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-09-26 08:25:43,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:25:43,175 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-09-26 08:25:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-09-26 08:25:43,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:43,177 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 83, 1, 1] [2018-09-26 08:25:43,177 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:43,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:43,177 INFO L82 PathProgramCache]: Analyzing trace with hash 800824277, now seen corresponding path program 83 times [2018-09-26 08:25:43,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10458 backedges. 0 proven. 10458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:43,650 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:43,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:25:43,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:25:43,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:25:43,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:25:43,652 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 86 states. [2018-09-26 08:25:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:43,793 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-09-26 08:25:43,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:25:43,793 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 253 [2018-09-26 08:25:43,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:43,794 INFO L225 Difference]: With dead ends: 258 [2018-09-26 08:25:43,794 INFO L226 Difference]: Without dead ends: 257 [2018-09-26 08:25:43,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:25:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-09-26 08:25:43,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-09-26 08:25:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 08:25:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-26 08:25:43,802 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 253 [2018-09-26 08:25:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:43,802 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-26 08:25:43,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:25:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-26 08:25:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-26 08:25:43,804 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:43,804 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 84, 1, 1] [2018-09-26 08:25:43,804 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:43,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:43,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1186991194, now seen corresponding path program 84 times [2018-09-26 08:25:43,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10710 backedges. 0 proven. 10710 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:44,345 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:44,345 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:25:44,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:25:44,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:25:44,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:25:44,347 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 87 states. [2018-09-26 08:25:44,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:44,449 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-09-26 08:25:44,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:25:44,450 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 256 [2018-09-26 08:25:44,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:44,451 INFO L225 Difference]: With dead ends: 261 [2018-09-26 08:25:44,451 INFO L226 Difference]: Without dead ends: 260 [2018-09-26 08:25:44,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:25:44,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-09-26 08:25:44,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2018-09-26 08:25:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-09-26 08:25:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-09-26 08:25:44,458 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 256 [2018-09-26 08:25:44,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:44,458 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-09-26 08:25:44,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:25:44,459 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-09-26 08:25:44,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-09-26 08:25:44,460 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:44,460 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 85, 1, 1] [2018-09-26 08:25:44,460 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:44,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:44,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1188610507, now seen corresponding path program 85 times [2018-09-26 08:25:44,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10965 backedges. 0 proven. 10965 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:44,961 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:44,961 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:25:44,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:25:44,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:25:44,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:25:44,963 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 88 states. [2018-09-26 08:25:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:45,127 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-09-26 08:25:45,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:25:45,127 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 259 [2018-09-26 08:25:45,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:45,128 INFO L225 Difference]: With dead ends: 264 [2018-09-26 08:25:45,129 INFO L226 Difference]: Without dead ends: 263 [2018-09-26 08:25:45,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:25:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-09-26 08:25:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-09-26 08:25:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-09-26 08:25:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-09-26 08:25:45,135 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 259 [2018-09-26 08:25:45,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:45,136 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-09-26 08:25:45,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:25:45,136 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-09-26 08:25:45,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-26 08:25:45,137 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:45,137 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 86, 1, 1] [2018-09-26 08:25:45,138 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:45,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:45,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2110043462, now seen corresponding path program 86 times [2018-09-26 08:25:45,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11223 backedges. 0 proven. 11223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:45,661 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:45,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:25:45,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:25:45,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:25:45,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:25:45,663 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 89 states. [2018-09-26 08:25:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:45,829 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-09-26 08:25:45,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:25:45,829 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 262 [2018-09-26 08:25:45,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:45,830 INFO L225 Difference]: With dead ends: 267 [2018-09-26 08:25:45,830 INFO L226 Difference]: Without dead ends: 266 [2018-09-26 08:25:45,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:25:45,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-09-26 08:25:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2018-09-26 08:25:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-09-26 08:25:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-09-26 08:25:45,837 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 262 [2018-09-26 08:25:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:45,837 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-09-26 08:25:45,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:25:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-09-26 08:25:45,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-26 08:25:45,839 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:45,839 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 87, 1, 1] [2018-09-26 08:25:45,839 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:45,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:45,839 INFO L82 PathProgramCache]: Analyzing trace with hash -836265835, now seen corresponding path program 87 times [2018-09-26 08:25:45,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11484 backedges. 0 proven. 11484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:46,301 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:46,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:25:46,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:25:46,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:25:46,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:25:46,302 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 90 states. [2018-09-26 08:25:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:46,459 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-09-26 08:25:46,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:25:46,459 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 265 [2018-09-26 08:25:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:46,460 INFO L225 Difference]: With dead ends: 270 [2018-09-26 08:25:46,461 INFO L226 Difference]: Without dead ends: 269 [2018-09-26 08:25:46,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:25:46,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-09-26 08:25:46,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-09-26 08:25:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-26 08:25:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-09-26 08:25:46,468 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 265 [2018-09-26 08:25:46,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:46,468 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-09-26 08:25:46,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:25:46,469 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-09-26 08:25:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-26 08:25:46,470 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:46,470 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 88, 1, 1] [2018-09-26 08:25:46,470 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:46,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:46,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1910095590, now seen corresponding path program 88 times [2018-09-26 08:25:46,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 11748 backedges. 0 proven. 11748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:46,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:46,968 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:25:46,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:25:46,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:25:46,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:25:46,969 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 91 states. [2018-09-26 08:25:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:47,092 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-09-26 08:25:47,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:25:47,092 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 268 [2018-09-26 08:25:47,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:47,094 INFO L225 Difference]: With dead ends: 273 [2018-09-26 08:25:47,094 INFO L226 Difference]: Without dead ends: 272 [2018-09-26 08:25:47,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:25:47,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-09-26 08:25:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2018-09-26 08:25:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-09-26 08:25:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-09-26 08:25:47,102 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 268 [2018-09-26 08:25:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:47,102 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-09-26 08:25:47,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:25:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-09-26 08:25:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-09-26 08:25:47,104 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:47,104 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 89, 1, 1] [2018-09-26 08:25:47,104 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:47,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:47,104 INFO L82 PathProgramCache]: Analyzing trace with hash -363681035, now seen corresponding path program 89 times [2018-09-26 08:25:47,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12015 backedges. 0 proven. 12015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:47,603 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:47,603 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:25:47,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:25:47,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:25:47,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:25:47,605 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 92 states. [2018-09-26 08:25:47,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:47,723 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-09-26 08:25:47,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:25:47,724 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 271 [2018-09-26 08:25:47,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:47,725 INFO L225 Difference]: With dead ends: 276 [2018-09-26 08:25:47,725 INFO L226 Difference]: Without dead ends: 275 [2018-09-26 08:25:47,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:25:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-26 08:25:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-09-26 08:25:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-09-26 08:25:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-09-26 08:25:47,734 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 271 [2018-09-26 08:25:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:47,734 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-09-26 08:25:47,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:25:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-09-26 08:25:47,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-09-26 08:25:47,736 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:47,736 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 90, 1, 1] [2018-09-26 08:25:47,736 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:47,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:47,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1781076102, now seen corresponding path program 90 times [2018-09-26 08:25:47,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 12285 backedges. 0 proven. 12285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:48,621 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:48,621 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:25:48,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:25:48,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:25:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:25:48,622 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 93 states. [2018-09-26 08:25:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:48,806 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-09-26 08:25:48,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:25:48,806 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 274 [2018-09-26 08:25:48,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:48,807 INFO L225 Difference]: With dead ends: 279 [2018-09-26 08:25:48,807 INFO L226 Difference]: Without dead ends: 278 [2018-09-26 08:25:48,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:25:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-26 08:25:48,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-09-26 08:25:48,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-09-26 08:25:48,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-09-26 08:25:48,814 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 274 [2018-09-26 08:25:48,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:48,814 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-09-26 08:25:48,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:25:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-09-26 08:25:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-09-26 08:25:48,816 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:48,816 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 91, 1, 1] [2018-09-26 08:25:48,816 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:48,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:48,816 INFO L82 PathProgramCache]: Analyzing trace with hash 12481877, now seen corresponding path program 91 times [2018-09-26 08:25:48,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12558 backedges. 0 proven. 12558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:49,320 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:49,320 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:25:49,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:25:49,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:25:49,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:25:49,322 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 94 states. [2018-09-26 08:25:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:49,446 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2018-09-26 08:25:49,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:25:49,446 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 277 [2018-09-26 08:25:49,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:49,447 INFO L225 Difference]: With dead ends: 282 [2018-09-26 08:25:49,447 INFO L226 Difference]: Without dead ends: 281 [2018-09-26 08:25:49,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:25:49,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-09-26 08:25:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-09-26 08:25:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-26 08:25:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-26 08:25:49,455 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 277 [2018-09-26 08:25:49,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:49,455 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-26 08:25:49,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:25:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-26 08:25:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-26 08:25:49,457 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:49,457 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 92, 1, 1] [2018-09-26 08:25:49,457 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:49,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:49,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1814255066, now seen corresponding path program 92 times [2018-09-26 08:25:49,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12834 backedges. 0 proven. 12834 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:50,012 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:50,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:25:50,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:25:50,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:25:50,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:25:50,014 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 95 states. [2018-09-26 08:25:50,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:50,233 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-09-26 08:25:50,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:25:50,233 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 280 [2018-09-26 08:25:50,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:50,235 INFO L225 Difference]: With dead ends: 285 [2018-09-26 08:25:50,235 INFO L226 Difference]: Without dead ends: 284 [2018-09-26 08:25:50,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:25:50,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-09-26 08:25:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2018-09-26 08:25:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-09-26 08:25:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2018-09-26 08:25:50,243 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 280 [2018-09-26 08:25:50,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:50,243 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 284 transitions. [2018-09-26 08:25:50,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:25:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 284 transitions. [2018-09-26 08:25:50,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-09-26 08:25:50,245 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:50,245 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 93, 1, 1] [2018-09-26 08:25:50,245 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:50,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:50,246 INFO L82 PathProgramCache]: Analyzing trace with hash -603916363, now seen corresponding path program 93 times [2018-09-26 08:25:50,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 13113 backedges. 0 proven. 13113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:50,867 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:50,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:25:50,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:25:50,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:25:50,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:25:50,869 INFO L87 Difference]: Start difference. First operand 284 states and 284 transitions. Second operand 96 states. [2018-09-26 08:25:50,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:50,965 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-09-26 08:25:50,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:25:50,965 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 283 [2018-09-26 08:25:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:50,967 INFO L225 Difference]: With dead ends: 288 [2018-09-26 08:25:50,967 INFO L226 Difference]: Without dead ends: 287 [2018-09-26 08:25:50,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:25:50,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-09-26 08:25:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-09-26 08:25:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-09-26 08:25:50,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-09-26 08:25:50,975 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 283 [2018-09-26 08:25:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:50,975 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-09-26 08:25:50,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:25:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-09-26 08:25:50,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-26 08:25:50,977 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:50,977 INFO L375 BasicCegarLoop]: trace histogram [95, 95, 94, 1, 1] [2018-09-26 08:25:50,977 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:50,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:50,978 INFO L82 PathProgramCache]: Analyzing trace with hash 345934790, now seen corresponding path program 94 times [2018-09-26 08:25:50,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 13395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:51,590 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:51,590 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:25:51,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:25:51,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:25:51,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:25:51,592 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 97 states. [2018-09-26 08:25:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:51,765 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-09-26 08:25:51,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:25:51,765 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 286 [2018-09-26 08:25:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:51,767 INFO L225 Difference]: With dead ends: 291 [2018-09-26 08:25:51,767 INFO L226 Difference]: Without dead ends: 290 [2018-09-26 08:25:51,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:25:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-26 08:25:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2018-09-26 08:25:51,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-09-26 08:25:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-09-26 08:25:51,775 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 286 [2018-09-26 08:25:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:51,775 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-09-26 08:25:51,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:25:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-09-26 08:25:51,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-09-26 08:25:51,777 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:51,777 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 95, 1, 1] [2018-09-26 08:25:51,777 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:51,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:51,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2117087765, now seen corresponding path program 95 times [2018-09-26 08:25:51,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 13680 backedges. 0 proven. 13680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:52,348 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:52,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:25:52,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:25:52,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:25:52,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:25:52,351 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 98 states. [2018-09-26 08:25:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:52,564 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2018-09-26 08:25:52,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:25:52,564 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 289 [2018-09-26 08:25:52,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:52,565 INFO L225 Difference]: With dead ends: 294 [2018-09-26 08:25:52,565 INFO L226 Difference]: Without dead ends: 293 [2018-09-26 08:25:52,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:25:52,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-09-26 08:25:52,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-09-26 08:25:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-26 08:25:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-09-26 08:25:52,573 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 289 [2018-09-26 08:25:52,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:52,573 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-09-26 08:25:52,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:25:52,574 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-09-26 08:25:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-26 08:25:52,575 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:52,575 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 96, 1, 1] [2018-09-26 08:25:52,576 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:52,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:52,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1432832666, now seen corresponding path program 96 times [2018-09-26 08:25:52,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 13968 backedges. 0 proven. 13968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:53,182 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:53,182 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:25:53,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:25:53,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:25:53,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:25:53,184 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 99 states. [2018-09-26 08:25:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:53,403 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-09-26 08:25:53,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:25:53,403 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 292 [2018-09-26 08:25:53,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:53,404 INFO L225 Difference]: With dead ends: 297 [2018-09-26 08:25:53,404 INFO L226 Difference]: Without dead ends: 296 [2018-09-26 08:25:53,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:25:53,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-09-26 08:25:53,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-09-26 08:25:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-09-26 08:25:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-09-26 08:25:53,412 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 292 [2018-09-26 08:25:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:53,413 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-09-26 08:25:53,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:25:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-09-26 08:25:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-26 08:25:53,414 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:53,414 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 97, 1, 1] [2018-09-26 08:25:53,415 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:53,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:53,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2132663179, now seen corresponding path program 97 times [2018-09-26 08:25:53,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 14259 backedges. 0 proven. 14259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:54,238 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:54,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:25:54,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:25:54,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:25:54,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:25:54,240 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 100 states. [2018-09-26 08:25:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:54,463 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-09-26 08:25:54,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:25:54,464 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 295 [2018-09-26 08:25:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:54,465 INFO L225 Difference]: With dead ends: 300 [2018-09-26 08:25:54,465 INFO L226 Difference]: Without dead ends: 299 [2018-09-26 08:25:54,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:25:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-09-26 08:25:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-09-26 08:25:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-09-26 08:25:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-09-26 08:25:54,470 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 295 [2018-09-26 08:25:54,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:54,470 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-09-26 08:25:54,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:25:54,470 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-09-26 08:25:54,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-09-26 08:25:54,471 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:54,472 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 98, 1, 1] [2018-09-26 08:25:54,472 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:54,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:54,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1282746118, now seen corresponding path program 98 times [2018-09-26 08:25:54,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14553 backedges. 0 proven. 14553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:55,068 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:55,068 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:25:55,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:25:55,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:25:55,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:25:55,070 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 101 states. [2018-09-26 08:25:55,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:55,281 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-09-26 08:25:55,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:25:55,281 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 298 [2018-09-26 08:25:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:55,282 INFO L225 Difference]: With dead ends: 303 [2018-09-26 08:25:55,282 INFO L226 Difference]: Without dead ends: 302 [2018-09-26 08:25:55,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:25:55,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-26 08:25:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2018-09-26 08:25:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-09-26 08:25:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-09-26 08:25:55,288 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 298 [2018-09-26 08:25:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:55,288 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-09-26 08:25:55,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:25:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-09-26 08:25:55,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-09-26 08:25:55,289 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:55,289 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 99, 1, 1] [2018-09-26 08:25:55,289 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:55,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:55,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1965870805, now seen corresponding path program 99 times [2018-09-26 08:25:55,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 14850 backedges. 0 proven. 14850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:55,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:55,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:25:55,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:25:55,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:25:55,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:25:55,935 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 102 states. [2018-09-26 08:25:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:56,041 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-09-26 08:25:56,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:25:56,041 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 301 [2018-09-26 08:25:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:56,043 INFO L225 Difference]: With dead ends: 306 [2018-09-26 08:25:56,043 INFO L226 Difference]: Without dead ends: 305 [2018-09-26 08:25:56,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:25:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-09-26 08:25:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-09-26 08:25:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-26 08:25:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-09-26 08:25:56,053 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 301 [2018-09-26 08:25:56,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:56,053 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-09-26 08:25:56,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:25:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-09-26 08:25:56,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-26 08:25:56,055 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:56,055 INFO L375 BasicCegarLoop]: trace histogram [101, 101, 100, 1, 1] [2018-09-26 08:25:56,055 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:56,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:56,056 INFO L82 PathProgramCache]: Analyzing trace with hash -916594522, now seen corresponding path program 100 times [2018-09-26 08:25:56,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 14851 proven. 299 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:57,123 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:57,123 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:25:57,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:25:57,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:25:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5153, Invalid=5353, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:25:57,125 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 103 states. [2018-09-26 08:25:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:57,388 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-09-26 08:25:57,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:25:57,388 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 304 [2018-09-26 08:25:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:57,388 INFO L225 Difference]: With dead ends: 307 [2018-09-26 08:25:57,389 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:25:57,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=5153, Invalid=5353, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:25:57,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:25:57,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:25:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:25:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:25:57,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 304 [2018-09-26 08:25:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:57,392 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:25:57,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:25:57,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:25:57,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:25:57,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:25:58,177 WARN L178 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 607 [2018-09-26 08:25:58,751 WARN L178 SmtUtils]: Spent 566.00 ms on a formula simplification that was a NOOP. DAG size: 607 [2018-09-26 08:25:59,269 WARN L178 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 605 [2018-09-26 08:25:59,280 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 2 23) the Hoare annotation is: true [2018-09-26 08:25:59,281 INFO L429 ceAbstractionStarter]: At program point mainEXIT(lines 2 23) the Hoare annotation is: true [2018-09-26 08:25:59,290 INFO L422 ceAbstractionStarter]: At program point L15(line 15) the Hoare annotation is: (let ((.cse0 (select |#length| main_q.base))) (or (and (<= (+ main_q.offset 108) .cse0) (<= (+ main_p.offset 292) main_q.offset)) (and (<= (+ main_q.offset 356) .cse0) (<= (+ main_p.offset 44) main_q.offset)) (and (<= (+ main_q.offset 340) .cse0) (<= (+ main_p.offset 60) main_q.offset)) (and (<= (+ main_q.offset 232) .cse0) (<= (+ main_p.offset 168) main_q.offset)) (and (<= (+ main_q.offset 148) .cse0) (<= (+ main_p.offset 252) main_q.offset)) (and (<= (+ main_q.offset 368) .cse0) (<= (+ main_p.offset 32) main_q.offset)) (and (<= (+ main_p.offset 352) main_q.offset) (<= (+ main_q.offset 48) .cse0)) (and (<= (+ main_p.offset 364) main_q.offset) (<= (+ main_q.offset 36) .cse0)) (and (<= (+ main_p.offset 88) main_q.offset) (<= (+ main_q.offset 312) .cse0)) (and (<= (+ main_p.offset 288) main_q.offset) (<= (+ main_q.offset 112) .cse0)) (and (<= (+ main_p.offset 384) main_q.offset) (<= (+ main_q.offset 16) .cse0)) (and (<= (+ main_p.offset 116) main_q.offset) (<= (+ main_q.offset 284) .cse0)) (and (<= (+ main_q.offset 236) .cse0) (<= (+ main_p.offset 164) main_q.offset)) (and (<= (+ main_q.offset 160) .cse0) (<= (+ main_p.offset 240) main_q.offset)) (and (<= (+ main_p.offset 316) main_q.offset) (<= (+ main_q.offset 84) .cse0)) (and (<= (+ main_p.offset 156) main_q.offset) (<= (+ main_q.offset 244) .cse0)) (and (<= (+ main_p.offset 204) main_q.offset) (<= (+ main_q.offset 196) .cse0)) (and (<= (+ main_p.offset 376) main_q.offset) (<= (+ main_q.offset 24) .cse0)) (and (<= (+ main_q.offset 80) .cse0) (<= (+ main_p.offset 320) main_q.offset)) (and (<= (+ main_q.offset 220) .cse0) (<= (+ main_p.offset 180) main_q.offset)) (and (<= (+ main_q.offset 276) .cse0) (<= (+ main_p.offset 124) main_q.offset)) (and (<= (+ main_p.offset 368) main_q.offset) (<= (+ main_q.offset 32) .cse0)) (and (<= (+ main_q.offset 240) .cse0) (<= (+ main_p.offset 160) main_q.offset)) (and (<= (+ main_q.offset 228) .cse0) (<= (+ main_p.offset 172) main_q.offset)) (and (<= (+ main_q.offset 64) .cse0) (<= (+ main_p.offset 336) main_q.offset)) (and (<= (+ main_p.offset 120) main_q.offset) (<= (+ main_q.offset 280) .cse0)) (and (<= (+ main_q.offset 92) .cse0) (<= (+ main_p.offset 308) main_q.offset)) (and (<= (+ main_p.offset 48) main_q.offset) (<= (+ main_q.offset 352) .cse0)) (and (<= (+ main_p.offset 96) main_q.offset) (<= (+ main_q.offset 304) .cse0)) (and (<= (+ main_p.offset 396) main_q.offset) (<= (+ main_q.offset 4) .cse0)) (and (<= (+ main_q.offset 272) .cse0) (<= (+ main_p.offset 128) main_q.offset)) (and (<= (+ main_q.offset 396) .cse0) (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 100) main_q.offset) (<= (+ main_q.offset 300) .cse0)) (and (<= (+ main_p.offset 148) main_q.offset) (<= (+ main_q.offset 252) .cse0)) (and (<= (+ main_q.offset 400) .cse0) (= main_p.offset main_q.offset)) (and (<= (+ main_q.offset 164) .cse0) (<= (+ main_p.offset 236) main_q.offset)) (and (<= (+ main_p.offset 16) main_q.offset) (<= (+ main_q.offset 384) .cse0)) (and (<= (+ main_p.offset 20) main_q.offset) (<= (+ main_q.offset 380) .cse0)) (and (<= (+ main_p.offset 52) main_q.offset) (<= (+ main_q.offset 348) .cse0)) (and (<= (+ main_q.offset 20) .cse0) (<= (+ main_p.offset 380) main_q.offset)) (and (<= (+ main_p.offset 56) main_q.offset) (<= (+ main_q.offset 344) .cse0)) (and (<= (+ main_p.offset 328) main_q.offset) (<= (+ main_q.offset 72) .cse0)) (and (<= (+ main_p.offset 344) main_q.offset) (<= (+ main_q.offset 56) .cse0)) (and (<= (+ main_q.offset 288) .cse0) (<= (+ main_p.offset 112) main_q.offset)) (and (<= (+ main_q.offset 372) .cse0) (<= (+ main_p.offset 28) main_q.offset)) (and (<= (+ main_p.offset 312) main_q.offset) (<= (+ main_q.offset 88) .cse0)) (and (<= (+ main_p.offset 216) main_q.offset) (<= (+ main_q.offset 184) .cse0)) (and (<= (+ main_p.offset 136) main_q.offset) (<= (+ main_q.offset 264) .cse0)) (and (<= (+ main_p.offset 188) main_q.offset) (<= (+ main_q.offset 212) .cse0)) (and (<= (+ main_q.offset 172) .cse0) (<= (+ main_p.offset 228) main_q.offset)) (and (<= (+ main_p.offset 108) main_q.offset) (<= (+ main_q.offset 292) .cse0)) (and (<= (+ main_p.offset 8) main_q.offset) (<= (+ main_q.offset 392) .cse0)) (and (<= (+ main_p.offset 296) main_q.offset) (<= (+ main_q.offset 104) .cse0)) (and (<= (+ main_p.offset 300) main_q.offset) (<= (+ main_q.offset 100) .cse0)) (and (<= (+ main_p.offset 200) main_q.offset) (<= (+ main_q.offset 200) .cse0)) (and (<= (+ main_p.offset 256) main_q.offset) (<= (+ main_q.offset 144) .cse0)) (and (<= (+ main_p.offset 192) main_q.offset) (<= (+ main_q.offset 208) .cse0)) (and (<= (+ main_p.offset 24) main_q.offset) (<= (+ main_q.offset 376) .cse0)) (and (<= (+ main_p.offset 208) main_q.offset) (<= (+ main_q.offset 192) .cse0)) (and (<= (+ main_q.offset 328) .cse0) (<= (+ main_p.offset 72) main_q.offset)) (and (<= (+ main_p.offset 284) main_q.offset) (<= (+ main_q.offset 116) .cse0)) (and (<= (+ main_q.offset 180) .cse0) (<= (+ main_p.offset 220) main_q.offset)) (and (<= (+ main_q.offset 60) .cse0) (<= (+ main_p.offset 340) main_q.offset)) (and (<= (+ main_q.offset 8) .cse0) (<= (+ main_p.offset 392) main_q.offset)) (and (<= (+ main_q.offset 260) .cse0) (<= (+ main_p.offset 140) main_q.offset)) (and (<= (+ main_p.offset 388) main_q.offset) (<= (+ main_q.offset 12) .cse0)) (and (<= (+ main_p.offset 232) main_q.offset) (<= (+ main_q.offset 168) .cse0)) (and (<= (+ main_q.offset 52) .cse0) (<= (+ main_p.offset 348) main_q.offset)) (and (<= (+ main_q.offset 388) .cse0) (<= (+ main_p.offset 12) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= (+ main_q.offset 320) .cse0)) (and (<= (+ main_q.offset 316) .cse0) (<= (+ main_p.offset 84) main_q.offset)) (and (<= (+ main_p.offset 196) main_q.offset) (<= (+ main_q.offset 204) .cse0)) (and (<= (+ main_q.offset 156) .cse0) (<= (+ main_p.offset 244) main_q.offset)) (and (<= (+ main_q.offset 188) .cse0) (<= (+ main_p.offset 212) main_q.offset)) (and (<= (+ main_p.offset 40) main_q.offset) (<= (+ main_q.offset 360) .cse0)) (and (<= (+ main_p.offset 248) main_q.offset) (<= (+ main_q.offset 152) .cse0)) (and (<= (+ main_p.offset 64) main_q.offset) (<= (+ main_q.offset 336) .cse0)) (and (<= (+ main_q.offset 224) .cse0) (<= (+ main_p.offset 176) main_q.offset)) (and (<= (+ main_p.offset 36) main_q.offset) (<= (+ main_q.offset 364) .cse0)) (and (<= (+ main_p.offset 132) main_q.offset) (<= (+ main_q.offset 268) .cse0)) (and (<= (+ main_q.offset 140) .cse0) (<= (+ main_p.offset 260) main_q.offset)) (and (<= (+ main_p.offset 76) main_q.offset) (<= (+ main_q.offset 324) .cse0)) (and (<= (+ main_p.offset 276) main_q.offset) (<= (+ main_q.offset 124) .cse0)) (and (<= (+ main_q.offset 76) .cse0) (<= (+ main_p.offset 324) main_q.offset)) (and (<= (+ main_p.offset 304) main_q.offset) (<= (+ main_q.offset 96) .cse0)) (and (<= (+ main_q.offset 248) .cse0) (<= (+ main_p.offset 152) main_q.offset)) (and (<= (+ main_p.offset 280) main_q.offset) (<= (+ main_q.offset 120) .cse0)) (and (<= (+ main_q.offset 308) .cse0) (<= (+ main_p.offset 92) main_q.offset)) (and (<= (+ main_p.offset 268) main_q.offset) (<= (+ main_q.offset 132) .cse0)) (and (<= (+ main_p.offset 356) main_q.offset) (<= (+ main_q.offset 44) .cse0)) (and (<= (+ main_p.offset 272) main_q.offset) (<= (+ main_q.offset 128) .cse0)) (and (<= (+ main_q.offset 216) .cse0) (<= (+ main_p.offset 184) main_q.offset)) (and (<= (+ main_p.offset 68) main_q.offset) (<= (+ main_q.offset 332) .cse0)) (and (<= (+ main_q.offset 176) .cse0) (<= (+ main_p.offset 224) main_q.offset)) (and (<= (+ main_q.offset 40) .cse0) (<= (+ main_p.offset 360) main_q.offset)) (and (<= (+ main_q.offset 136) .cse0) (<= (+ main_p.offset 264) main_q.offset)) (and (<= (+ main_q.offset 28) .cse0) (<= (+ main_p.offset 372) main_q.offset)) (and (<= (+ main_q.offset 68) .cse0) (<= (+ main_p.offset 332) main_q.offset)) (and (<= (+ main_q.offset 256) .cse0) (<= (+ main_p.offset 144) main_q.offset)) (and (<= (+ main_p.offset 104) main_q.offset) (<= (+ main_q.offset 296) .cse0)))) [2018-09-26 08:25:59,298 INFO L422 ceAbstractionStarter]: At program point L14(lines 14 19) the Hoare annotation is: (let ((.cse0 (select |#length| main_q.base))) (or (and (<= (+ main_q.offset 108) .cse0) (<= (+ main_p.offset 292) main_q.offset)) (and (<= (+ main_q.offset 356) .cse0) (<= (+ main_p.offset 44) main_q.offset)) (and (<= (+ main_q.offset 340) .cse0) (<= (+ main_p.offset 60) main_q.offset)) (and (<= (+ main_q.offset 232) .cse0) (<= (+ main_p.offset 168) main_q.offset)) (and (<= (+ main_q.offset 148) .cse0) (<= (+ main_p.offset 252) main_q.offset)) (and (<= (+ main_q.offset 368) .cse0) (<= (+ main_p.offset 32) main_q.offset)) (and (<= (+ main_p.offset 352) main_q.offset) (<= (+ main_q.offset 48) .cse0)) (and (<= (+ main_p.offset 364) main_q.offset) (<= (+ main_q.offset 36) .cse0)) (and (<= (+ main_p.offset 88) main_q.offset) (<= (+ main_q.offset 312) .cse0)) (and (<= (+ main_p.offset 288) main_q.offset) (<= (+ main_q.offset 112) .cse0)) (and (<= (+ main_p.offset 384) main_q.offset) (<= (+ main_q.offset 16) .cse0)) (and (<= (+ main_p.offset 116) main_q.offset) (<= (+ main_q.offset 284) .cse0)) (and (<= (+ main_q.offset 236) .cse0) (<= (+ main_p.offset 164) main_q.offset)) (and (<= (+ main_q.offset 160) .cse0) (<= (+ main_p.offset 240) main_q.offset)) (and (<= (+ main_p.offset 316) main_q.offset) (<= (+ main_q.offset 84) .cse0)) (and (<= (+ main_p.offset 156) main_q.offset) (<= (+ main_q.offset 244) .cse0)) (and (<= (+ main_p.offset 204) main_q.offset) (<= (+ main_q.offset 196) .cse0)) (and (<= (+ main_p.offset 376) main_q.offset) (<= (+ main_q.offset 24) .cse0)) (and (<= (+ main_q.offset 80) .cse0) (<= (+ main_p.offset 320) main_q.offset)) (and (<= (+ main_q.offset 220) .cse0) (<= (+ main_p.offset 180) main_q.offset)) (and (<= (+ main_q.offset 276) .cse0) (<= (+ main_p.offset 124) main_q.offset)) (and (<= (+ main_p.offset 368) main_q.offset) (<= (+ main_q.offset 32) .cse0)) (and (<= (+ main_q.offset 240) .cse0) (<= (+ main_p.offset 160) main_q.offset)) (and (<= (+ main_q.offset 228) .cse0) (<= (+ main_p.offset 172) main_q.offset)) (and (<= (+ main_q.offset 64) .cse0) (<= (+ main_p.offset 336) main_q.offset)) (and (<= (+ main_p.offset 120) main_q.offset) (<= (+ main_q.offset 280) .cse0)) (and (<= (+ main_q.offset 92) .cse0) (<= (+ main_p.offset 308) main_q.offset)) (and (<= (+ main_p.offset 48) main_q.offset) (<= (+ main_q.offset 352) .cse0)) (and (<= (+ main_p.offset 96) main_q.offset) (<= (+ main_q.offset 304) .cse0)) (and (<= (+ main_p.offset 396) main_q.offset) (<= (+ main_q.offset 4) .cse0)) (and (<= (+ main_q.offset 272) .cse0) (<= (+ main_p.offset 128) main_q.offset)) (and (<= (+ main_q.offset 396) .cse0) (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 100) main_q.offset) (<= (+ main_q.offset 300) .cse0)) (and (<= (+ main_p.offset 148) main_q.offset) (<= (+ main_q.offset 252) .cse0)) (and (<= (+ main_q.offset 400) .cse0) (= main_p.offset main_q.offset)) (and (<= (+ main_q.offset 164) .cse0) (<= (+ main_p.offset 236) main_q.offset)) (and (<= (+ main_p.offset 16) main_q.offset) (<= (+ main_q.offset 384) .cse0)) (and (<= (+ main_p.offset 20) main_q.offset) (<= (+ main_q.offset 380) .cse0)) (and (<= (+ main_p.offset 52) main_q.offset) (<= (+ main_q.offset 348) .cse0)) (and (<= (+ main_q.offset 20) .cse0) (<= (+ main_p.offset 380) main_q.offset)) (and (<= (+ main_p.offset 56) main_q.offset) (<= (+ main_q.offset 344) .cse0)) (and (<= (+ main_p.offset 328) main_q.offset) (<= (+ main_q.offset 72) .cse0)) (and (<= (+ main_p.offset 344) main_q.offset) (<= (+ main_q.offset 56) .cse0)) (and (<= (+ main_q.offset 288) .cse0) (<= (+ main_p.offset 112) main_q.offset)) (and (<= (+ main_q.offset 372) .cse0) (<= (+ main_p.offset 28) main_q.offset)) (and (<= (+ main_p.offset 312) main_q.offset) (<= (+ main_q.offset 88) .cse0)) (and (<= (+ main_p.offset 216) main_q.offset) (<= (+ main_q.offset 184) .cse0)) (and (<= (+ main_p.offset 136) main_q.offset) (<= (+ main_q.offset 264) .cse0)) (and (<= (+ main_p.offset 188) main_q.offset) (<= (+ main_q.offset 212) .cse0)) (and (<= (+ main_q.offset 172) .cse0) (<= (+ main_p.offset 228) main_q.offset)) (and (<= (+ main_p.offset 108) main_q.offset) (<= (+ main_q.offset 292) .cse0)) (and (<= (+ main_p.offset 8) main_q.offset) (<= (+ main_q.offset 392) .cse0)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 296) main_q.offset) (<= (+ main_q.offset 104) .cse0)) (and (<= (+ main_p.offset 300) main_q.offset) (<= (+ main_q.offset 100) .cse0)) (and (<= (+ main_p.offset 200) main_q.offset) (<= (+ main_q.offset 200) .cse0)) (and (<= (+ main_p.offset 256) main_q.offset) (<= (+ main_q.offset 144) .cse0)) (and (<= (+ main_p.offset 192) main_q.offset) (<= (+ main_q.offset 208) .cse0)) (and (<= (+ main_p.offset 24) main_q.offset) (<= (+ main_q.offset 376) .cse0)) (and (<= (+ main_p.offset 208) main_q.offset) (<= (+ main_q.offset 192) .cse0)) (and (<= (+ main_q.offset 328) .cse0) (<= (+ main_p.offset 72) main_q.offset)) (and (<= (+ main_p.offset 284) main_q.offset) (<= (+ main_q.offset 116) .cse0)) (and (<= (+ main_q.offset 180) .cse0) (<= (+ main_p.offset 220) main_q.offset)) (and (<= (+ main_q.offset 60) .cse0) (<= (+ main_p.offset 340) main_q.offset)) (and (<= (+ main_q.offset 8) .cse0) (<= (+ main_p.offset 392) main_q.offset)) (and (<= (+ main_q.offset 260) .cse0) (<= (+ main_p.offset 140) main_q.offset)) (and (<= (+ main_p.offset 388) main_q.offset) (<= (+ main_q.offset 12) .cse0)) (and (<= (+ main_p.offset 232) main_q.offset) (<= (+ main_q.offset 168) .cse0)) (and (<= (+ main_q.offset 52) .cse0) (<= (+ main_p.offset 348) main_q.offset)) (and (<= (+ main_q.offset 388) .cse0) (<= (+ main_p.offset 12) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= (+ main_q.offset 320) .cse0)) (and (<= (+ main_q.offset 316) .cse0) (<= (+ main_p.offset 84) main_q.offset)) (and (<= (+ main_p.offset 196) main_q.offset) (<= (+ main_q.offset 204) .cse0)) (and (<= (+ main_q.offset 156) .cse0) (<= (+ main_p.offset 244) main_q.offset)) (and (<= (+ main_q.offset 188) .cse0) (<= (+ main_p.offset 212) main_q.offset)) (and (<= (+ main_p.offset 40) main_q.offset) (<= (+ main_q.offset 360) .cse0)) (and (<= (+ main_p.offset 248) main_q.offset) (<= (+ main_q.offset 152) .cse0)) (and (<= (+ main_p.offset 64) main_q.offset) (<= (+ main_q.offset 336) .cse0)) (and (<= (+ main_q.offset 224) .cse0) (<= (+ main_p.offset 176) main_q.offset)) (and (<= (+ main_p.offset 36) main_q.offset) (<= (+ main_q.offset 364) .cse0)) (and (<= (+ main_p.offset 132) main_q.offset) (<= (+ main_q.offset 268) .cse0)) (and (<= (+ main_q.offset 140) .cse0) (<= (+ main_p.offset 260) main_q.offset)) (and (<= (+ main_p.offset 76) main_q.offset) (<= (+ main_q.offset 324) .cse0)) (and (<= (+ main_p.offset 276) main_q.offset) (<= (+ main_q.offset 124) .cse0)) (and (<= (+ main_q.offset 76) .cse0) (<= (+ main_p.offset 324) main_q.offset)) (and (<= (+ main_p.offset 304) main_q.offset) (<= (+ main_q.offset 96) .cse0)) (and (<= (+ main_q.offset 248) .cse0) (<= (+ main_p.offset 152) main_q.offset)) (and (<= (+ main_p.offset 280) main_q.offset) (<= (+ main_q.offset 120) .cse0)) (and (<= (+ main_q.offset 308) .cse0) (<= (+ main_p.offset 92) main_q.offset)) (and (<= (+ main_p.offset 268) main_q.offset) (<= (+ main_q.offset 132) .cse0)) (and (<= (+ main_p.offset 356) main_q.offset) (<= (+ main_q.offset 44) .cse0)) (and (<= (+ main_p.offset 272) main_q.offset) (<= (+ main_q.offset 128) .cse0)) (and (<= (+ main_q.offset 216) .cse0) (<= (+ main_p.offset 184) main_q.offset)) (and (<= (+ main_p.offset 68) main_q.offset) (<= (+ main_q.offset 332) .cse0)) (and (<= (+ main_q.offset 176) .cse0) (<= (+ main_p.offset 224) main_q.offset)) (and (<= (+ main_q.offset 40) .cse0) (<= (+ main_p.offset 360) main_q.offset)) (and (<= (+ main_q.offset 136) .cse0) (<= (+ main_p.offset 264) main_q.offset)) (and (<= (+ main_q.offset 28) .cse0) (<= (+ main_p.offset 372) main_q.offset)) (and (<= (+ main_q.offset 68) .cse0) (<= (+ main_p.offset 332) main_q.offset)) (and (<= (+ main_q.offset 256) .cse0) (<= (+ main_p.offset 144) main_q.offset)) (and (<= (+ main_p.offset 104) main_q.offset) (<= (+ main_q.offset 296) .cse0)))) [2018-09-26 08:25:59,298 INFO L426 ceAbstractionStarter]: For program point L14-1(lines 14 19) no Hoare annotation was computed. [2018-09-26 08:25:59,302 INFO L422 ceAbstractionStarter]: At program point L12-1(lines 12 21) the Hoare annotation is: (let ((.cse0 (select |#length| main_q.base))) (or (and (<= (+ main_q.offset 108) .cse0) (<= (+ main_p.offset 292) main_q.offset)) (and (<= (+ main_q.offset 356) .cse0) (<= (+ main_p.offset 44) main_q.offset)) (and (<= (+ main_q.offset 340) .cse0) (<= (+ main_p.offset 60) main_q.offset)) (and (<= (+ main_q.offset 232) .cse0) (<= (+ main_p.offset 168) main_q.offset)) (and (<= (+ main_q.offset 148) .cse0) (<= (+ main_p.offset 252) main_q.offset)) (and (<= (+ main_q.offset 368) .cse0) (<= (+ main_p.offset 32) main_q.offset)) (and (<= (+ main_p.offset 352) main_q.offset) (<= (+ main_q.offset 48) .cse0)) (and (<= (+ main_p.offset 364) main_q.offset) (<= (+ main_q.offset 36) .cse0)) (and (<= (+ main_p.offset 88) main_q.offset) (<= (+ main_q.offset 312) .cse0)) (and (<= (+ main_p.offset 288) main_q.offset) (<= (+ main_q.offset 112) .cse0)) (and (<= (+ main_p.offset 384) main_q.offset) (<= (+ main_q.offset 16) .cse0)) (and (<= (+ main_p.offset 116) main_q.offset) (<= (+ main_q.offset 284) .cse0)) (and (<= (+ main_q.offset 236) .cse0) (<= (+ main_p.offset 164) main_q.offset)) (and (<= (+ main_q.offset 160) .cse0) (<= (+ main_p.offset 240) main_q.offset)) (and (<= (+ main_p.offset 316) main_q.offset) (<= (+ main_q.offset 84) .cse0)) (and (<= (+ main_p.offset 156) main_q.offset) (<= (+ main_q.offset 244) .cse0)) (and (<= (+ main_p.offset 204) main_q.offset) (<= (+ main_q.offset 196) .cse0)) (and (<= (+ main_p.offset 376) main_q.offset) (<= (+ main_q.offset 24) .cse0)) (and (<= (+ main_q.offset 80) .cse0) (<= (+ main_p.offset 320) main_q.offset)) (and (<= (+ main_q.offset 220) .cse0) (<= (+ main_p.offset 180) main_q.offset)) (and (<= (+ main_q.offset 276) .cse0) (<= (+ main_p.offset 124) main_q.offset)) (and (<= (+ main_p.offset 368) main_q.offset) (<= (+ main_q.offset 32) .cse0)) (and (<= (+ main_q.offset 240) .cse0) (<= (+ main_p.offset 160) main_q.offset)) (and (<= (+ main_q.offset 228) .cse0) (<= (+ main_p.offset 172) main_q.offset)) (and (<= (+ main_q.offset 64) .cse0) (<= (+ main_p.offset 336) main_q.offset)) (and (<= (+ main_p.offset 120) main_q.offset) (<= (+ main_q.offset 280) .cse0)) (and (<= (+ main_q.offset 92) .cse0) (<= (+ main_p.offset 308) main_q.offset)) (and (<= (+ main_p.offset 48) main_q.offset) (<= (+ main_q.offset 352) .cse0)) (and (<= (+ main_p.offset 96) main_q.offset) (<= (+ main_q.offset 304) .cse0)) (and (<= (+ main_p.offset 396) main_q.offset) (<= (+ main_q.offset 4) .cse0)) (and (<= (+ main_q.offset 272) .cse0) (<= (+ main_p.offset 128) main_q.offset)) (and (<= (+ main_q.offset 396) .cse0) (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 100) main_q.offset) (<= (+ main_q.offset 300) .cse0)) (and (<= (+ main_p.offset 148) main_q.offset) (<= (+ main_q.offset 252) .cse0)) (and (<= (+ main_q.offset 400) .cse0) (= main_p.offset main_q.offset)) (and (<= (+ main_q.offset 164) .cse0) (<= (+ main_p.offset 236) main_q.offset)) (and (<= (+ main_p.offset 16) main_q.offset) (<= (+ main_q.offset 384) .cse0)) (and (<= (+ main_p.offset 20) main_q.offset) (<= (+ main_q.offset 380) .cse0)) (and (<= (+ main_p.offset 52) main_q.offset) (<= (+ main_q.offset 348) .cse0)) (and (<= (+ main_q.offset 20) .cse0) (<= (+ main_p.offset 380) main_q.offset)) (and (<= (+ main_p.offset 56) main_q.offset) (<= (+ main_q.offset 344) .cse0)) (and (<= (+ main_p.offset 328) main_q.offset) (<= (+ main_q.offset 72) .cse0)) (and (<= (+ main_p.offset 344) main_q.offset) (<= (+ main_q.offset 56) .cse0)) (and (<= (+ main_q.offset 288) .cse0) (<= (+ main_p.offset 112) main_q.offset)) (and (<= (+ main_q.offset 372) .cse0) (<= (+ main_p.offset 28) main_q.offset)) (and (<= (+ main_p.offset 312) main_q.offset) (<= (+ main_q.offset 88) .cse0)) (and (<= (+ main_p.offset 216) main_q.offset) (<= (+ main_q.offset 184) .cse0)) (and (<= (+ main_p.offset 136) main_q.offset) (<= (+ main_q.offset 264) .cse0)) (and (<= (+ main_p.offset 188) main_q.offset) (<= (+ main_q.offset 212) .cse0)) (and (<= (+ main_q.offset 172) .cse0) (<= (+ main_p.offset 228) main_q.offset)) (and (<= (+ main_p.offset 108) main_q.offset) (<= (+ main_q.offset 292) .cse0)) (and (<= (+ main_p.offset 8) main_q.offset) (<= (+ main_q.offset 392) .cse0)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 296) main_q.offset) (<= (+ main_q.offset 104) .cse0)) (and (<= (+ main_p.offset 300) main_q.offset) (<= (+ main_q.offset 100) .cse0)) (and (<= (+ main_p.offset 200) main_q.offset) (<= (+ main_q.offset 200) .cse0)) (and (<= (+ main_p.offset 256) main_q.offset) (<= (+ main_q.offset 144) .cse0)) (and (<= (+ main_p.offset 192) main_q.offset) (<= (+ main_q.offset 208) .cse0)) (and (<= (+ main_p.offset 24) main_q.offset) (<= (+ main_q.offset 376) .cse0)) (and (<= (+ main_p.offset 208) main_q.offset) (<= (+ main_q.offset 192) .cse0)) (and (<= (+ main_q.offset 328) .cse0) (<= (+ main_p.offset 72) main_q.offset)) (and (<= (+ main_p.offset 284) main_q.offset) (<= (+ main_q.offset 116) .cse0)) (and (<= (+ main_q.offset 180) .cse0) (<= (+ main_p.offset 220) main_q.offset)) (and (<= (+ main_q.offset 60) .cse0) (<= (+ main_p.offset 340) main_q.offset)) (and (<= (+ main_q.offset 8) .cse0) (<= (+ main_p.offset 392) main_q.offset)) (and (<= (+ main_q.offset 260) .cse0) (<= (+ main_p.offset 140) main_q.offset)) (and (<= (+ main_p.offset 388) main_q.offset) (<= (+ main_q.offset 12) .cse0)) (and (<= (+ main_p.offset 232) main_q.offset) (<= (+ main_q.offset 168) .cse0)) (and (<= (+ main_q.offset 52) .cse0) (<= (+ main_p.offset 348) main_q.offset)) (and (<= (+ main_q.offset 388) .cse0) (<= (+ main_p.offset 12) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= (+ main_q.offset 320) .cse0)) (and (<= (+ main_q.offset 316) .cse0) (<= (+ main_p.offset 84) main_q.offset)) (and (<= (+ main_p.offset 196) main_q.offset) (<= (+ main_q.offset 204) .cse0)) (and (<= (+ main_q.offset 156) .cse0) (<= (+ main_p.offset 244) main_q.offset)) (and (<= (+ main_q.offset 188) .cse0) (<= (+ main_p.offset 212) main_q.offset)) (and (<= (+ main_p.offset 40) main_q.offset) (<= (+ main_q.offset 360) .cse0)) (and (<= (+ main_p.offset 248) main_q.offset) (<= (+ main_q.offset 152) .cse0)) (and (<= (+ main_p.offset 64) main_q.offset) (<= (+ main_q.offset 336) .cse0)) (and (<= (+ main_q.offset 224) .cse0) (<= (+ main_p.offset 176) main_q.offset)) (and (<= (+ main_p.offset 36) main_q.offset) (<= (+ main_q.offset 364) .cse0)) (and (<= (+ main_p.offset 132) main_q.offset) (<= (+ main_q.offset 268) .cse0)) (and (<= (+ main_q.offset 140) .cse0) (<= (+ main_p.offset 260) main_q.offset)) (and (<= (+ main_p.offset 76) main_q.offset) (<= (+ main_q.offset 324) .cse0)) (and (<= (+ main_p.offset 276) main_q.offset) (<= (+ main_q.offset 124) .cse0)) (and (<= (+ main_q.offset 76) .cse0) (<= (+ main_p.offset 324) main_q.offset)) (and (<= (+ main_p.offset 304) main_q.offset) (<= (+ main_q.offset 96) .cse0)) (and (<= (+ main_q.offset 248) .cse0) (<= (+ main_p.offset 152) main_q.offset)) (and (<= (+ main_p.offset 280) main_q.offset) (<= (+ main_q.offset 120) .cse0)) (and (<= (+ main_q.offset 308) .cse0) (<= (+ main_p.offset 92) main_q.offset)) (and (<= (+ main_p.offset 268) main_q.offset) (<= (+ main_q.offset 132) .cse0)) (and (<= (+ main_p.offset 356) main_q.offset) (<= (+ main_q.offset 44) .cse0)) (and (<= (+ main_p.offset 272) main_q.offset) (<= (+ main_q.offset 128) .cse0)) (and (<= (+ main_q.offset 216) .cse0) (<= (+ main_p.offset 184) main_q.offset)) (and (<= (+ main_p.offset 68) main_q.offset) (<= (+ main_q.offset 332) .cse0)) (and (<= (+ main_q.offset 176) .cse0) (<= (+ main_p.offset 224) main_q.offset)) (and (<= (+ main_q.offset 40) .cse0) (<= (+ main_p.offset 360) main_q.offset)) (and (<= (+ main_q.offset 136) .cse0) (<= (+ main_p.offset 264) main_q.offset)) (and (<= (+ main_q.offset 28) .cse0) (<= (+ main_p.offset 372) main_q.offset)) (and (<= (+ main_q.offset 68) .cse0) (<= (+ main_p.offset 332) main_q.offset)) (and (<= (+ main_q.offset 256) .cse0) (<= (+ main_p.offset 144) main_q.offset)) (and (<= (+ main_p.offset 104) main_q.offset) (<= (+ main_q.offset 296) .cse0)))) [2018-09-26 08:25:59,303 INFO L429 ceAbstractionStarter]: At program point L12-2(lines 2 23) the Hoare annotation is: true [2018-09-26 08:25:59,303 INFO L422 ceAbstractionStarter]: At program point mainErr0ASSERT_VIOLATIONASSERT(line 15) the Hoare annotation is: false [2018-09-26 08:25:59,385 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:25:59 BoogieIcfgContainer [2018-09-26 08:25:59,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:25:59,386 INFO L168 Benchmark]: Toolchain (without parser) took 46403.03 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-26 08:25:59,387 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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-26 08:25:59,388 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.42 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-26 08:25:59,388 INFO L168 Benchmark]: Boogie Preprocessor took 33.07 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-26 08:25:59,388 INFO L168 Benchmark]: RCFGBuilder took 245.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:25:59,389 INFO L168 Benchmark]: TraceAbstraction took 46044.98 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-26 08:25:59,395 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.25 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 72.42 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 33.07 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 245.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46044.98 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset + 108 <= #length[q!base] && p!offset + 292 <= q!offset) || (q!offset + 356 <= #length[q!base] && p!offset + 44 <= q!offset)) || (q!offset + 340 <= #length[q!base] && p!offset + 60 <= q!offset)) || (q!offset + 232 <= #length[q!base] && p!offset + 168 <= q!offset)) || (q!offset + 148 <= #length[q!base] && p!offset + 252 <= q!offset)) || (q!offset + 368 <= #length[q!base] && p!offset + 32 <= q!offset)) || (p!offset + 352 <= q!offset && q!offset + 48 <= #length[q!base])) || (p!offset + 364 <= q!offset && q!offset + 36 <= #length[q!base])) || (p!offset + 88 <= q!offset && q!offset + 312 <= #length[q!base])) || (p!offset + 288 <= q!offset && q!offset + 112 <= #length[q!base])) || (p!offset + 384 <= q!offset && q!offset + 16 <= #length[q!base])) || (p!offset + 116 <= q!offset && q!offset + 284 <= #length[q!base])) || (q!offset + 236 <= #length[q!base] && p!offset + 164 <= q!offset)) || (q!offset + 160 <= #length[q!base] && p!offset + 240 <= q!offset)) || (p!offset + 316 <= q!offset && q!offset + 84 <= #length[q!base])) || (p!offset + 156 <= q!offset && q!offset + 244 <= #length[q!base])) || (p!offset + 204 <= q!offset && q!offset + 196 <= #length[q!base])) || (p!offset + 376 <= q!offset && q!offset + 24 <= #length[q!base])) || (q!offset + 80 <= #length[q!base] && p!offset + 320 <= q!offset)) || (q!offset + 220 <= #length[q!base] && p!offset + 180 <= q!offset)) || (q!offset + 276 <= #length[q!base] && p!offset + 124 <= q!offset)) || (p!offset + 368 <= q!offset && q!offset + 32 <= #length[q!base])) || (q!offset + 240 <= #length[q!base] && p!offset + 160 <= q!offset)) || (q!offset + 228 <= #length[q!base] && p!offset + 172 <= q!offset)) || (q!offset + 64 <= #length[q!base] && p!offset + 336 <= q!offset)) || (p!offset + 120 <= q!offset && q!offset + 280 <= #length[q!base])) || (q!offset + 92 <= #length[q!base] && p!offset + 308 <= q!offset)) || (p!offset + 48 <= q!offset && q!offset + 352 <= #length[q!base])) || (p!offset + 96 <= q!offset && q!offset + 304 <= #length[q!base])) || (p!offset + 396 <= q!offset && q!offset + 4 <= #length[q!base])) || (q!offset + 272 <= #length[q!base] && p!offset + 128 <= q!offset)) || (q!offset + 396 <= #length[q!base] && p!offset + 4 <= q!offset)) || (p!offset + 100 <= q!offset && q!offset + 300 <= #length[q!base])) || (p!offset + 148 <= q!offset && q!offset + 252 <= #length[q!base])) || (q!offset + 400 <= #length[q!base] && p!offset == q!offset)) || (q!offset + 164 <= #length[q!base] && p!offset + 236 <= q!offset)) || (p!offset + 16 <= q!offset && q!offset + 384 <= #length[q!base])) || (p!offset + 20 <= q!offset && q!offset + 380 <= #length[q!base])) || (p!offset + 52 <= q!offset && q!offset + 348 <= #length[q!base])) || (q!offset + 20 <= #length[q!base] && p!offset + 380 <= q!offset)) || (p!offset + 56 <= q!offset && q!offset + 344 <= #length[q!base])) || (p!offset + 328 <= q!offset && q!offset + 72 <= #length[q!base])) || (p!offset + 344 <= q!offset && q!offset + 56 <= #length[q!base])) || (q!offset + 288 <= #length[q!base] && p!offset + 112 <= q!offset)) || (q!offset + 372 <= #length[q!base] && p!offset + 28 <= q!offset)) || (p!offset + 312 <= q!offset && q!offset + 88 <= #length[q!base])) || (p!offset + 216 <= q!offset && q!offset + 184 <= #length[q!base])) || (p!offset + 136 <= q!offset && q!offset + 264 <= #length[q!base])) || (p!offset + 188 <= q!offset && q!offset + 212 <= #length[q!base])) || (q!offset + 172 <= #length[q!base] && p!offset + 228 <= q!offset)) || (p!offset + 108 <= q!offset && q!offset + 292 <= #length[q!base])) || (p!offset + 8 <= q!offset && q!offset + 392 <= #length[q!base])) || p!offset + 400 <= q!offset) || (p!offset + 296 <= q!offset && q!offset + 104 <= #length[q!base])) || (p!offset + 300 <= q!offset && q!offset + 100 <= #length[q!base])) || (p!offset + 200 <= q!offset && q!offset + 200 <= #length[q!base])) || (p!offset + 256 <= q!offset && q!offset + 144 <= #length[q!base])) || (p!offset + 192 <= q!offset && q!offset + 208 <= #length[q!base])) || (p!offset + 24 <= q!offset && q!offset + 376 <= #length[q!base])) || (p!offset + 208 <= q!offset && q!offset + 192 <= #length[q!base])) || (q!offset + 328 <= #length[q!base] && p!offset + 72 <= q!offset)) || (p!offset + 284 <= q!offset && q!offset + 116 <= #length[q!base])) || (q!offset + 180 <= #length[q!base] && p!offset + 220 <= q!offset)) || (q!offset + 60 <= #length[q!base] && p!offset + 340 <= q!offset)) || (q!offset + 8 <= #length[q!base] && p!offset + 392 <= q!offset)) || (q!offset + 260 <= #length[q!base] && p!offset + 140 <= q!offset)) || (p!offset + 388 <= q!offset && q!offset + 12 <= #length[q!base])) || (p!offset + 232 <= q!offset && q!offset + 168 <= #length[q!base])) || (q!offset + 52 <= #length[q!base] && p!offset + 348 <= q!offset)) || (q!offset + 388 <= #length[q!base] && p!offset + 12 <= q!offset)) || (p!offset + 80 <= q!offset && q!offset + 320 <= #length[q!base])) || (q!offset + 316 <= #length[q!base] && p!offset + 84 <= q!offset)) || (p!offset + 196 <= q!offset && q!offset + 204 <= #length[q!base])) || (q!offset + 156 <= #length[q!base] && p!offset + 244 <= q!offset)) || (q!offset + 188 <= #length[q!base] && p!offset + 212 <= q!offset)) || (p!offset + 40 <= q!offset && q!offset + 360 <= #length[q!base])) || (p!offset + 248 <= q!offset && q!offset + 152 <= #length[q!base])) || (p!offset + 64 <= q!offset && q!offset + 336 <= #length[q!base])) || (q!offset + 224 <= #length[q!base] && p!offset + 176 <= q!offset)) || (p!offset + 36 <= q!offset && q!offset + 364 <= #length[q!base])) || (p!offset + 132 <= q!offset && q!offset + 268 <= #length[q!base])) || (q!offset + 140 <= #length[q!base] && p!offset + 260 <= q!offset)) || (p!offset + 76 <= q!offset && q!offset + 324 <= #length[q!base])) || (p!offset + 276 <= q!offset && q!offset + 124 <= #length[q!base])) || (q!offset + 76 <= #length[q!base] && p!offset + 324 <= q!offset)) || (p!offset + 304 <= q!offset && q!offset + 96 <= #length[q!base])) || (q!offset + 248 <= #length[q!base] && p!offset + 152 <= q!offset)) || (p!offset + 280 <= q!offset && q!offset + 120 <= #length[q!base])) || (q!offset + 308 <= #length[q!base] && p!offset + 92 <= q!offset)) || (p!offset + 268 <= q!offset && q!offset + 132 <= #length[q!base])) || (p!offset + 356 <= q!offset && q!offset + 44 <= #length[q!base])) || (p!offset + 272 <= q!offset && q!offset + 128 <= #length[q!base])) || (q!offset + 216 <= #length[q!base] && p!offset + 184 <= q!offset)) || (p!offset + 68 <= q!offset && q!offset + 332 <= #length[q!base])) || (q!offset + 176 <= #length[q!base] && p!offset + 224 <= q!offset)) || (q!offset + 40 <= #length[q!base] && p!offset + 360 <= q!offset)) || (q!offset + 136 <= #length[q!base] && p!offset + 264 <= q!offset)) || (q!offset + 28 <= #length[q!base] && p!offset + 372 <= q!offset)) || (q!offset + 68 <= #length[q!base] && p!offset + 332 <= q!offset)) || (q!offset + 256 <= #length[q!base] && p!offset + 144 <= q!offset)) || (p!offset + 104 <= q!offset && q!offset + 296 <= #length[q!base]) - ProcedureContractResult [Line: 2]: Procedure Contract for main Derived contract for procedure main: true - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 45.8s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 403 SDtfs, 2 SDslu, 5342 SDs, 0 SdLazy, 14475 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=100, 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.7s AutomataMinimizationTime, 101 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 313 NumberOfFragments, 3911 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 24.4s InterpolantComputationTime, 15554 NumberOfCodeBlocks, 15554 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 15453 ConstructedInterpolants, 0 QuantifiedInterpolants, 21772065 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 101 InterpolantComputations, 1 PerfectInterpolantSequences, 14851/515100 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified03.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-25-59-443.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified03.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-25-59-443.csv Received shutdown request...