java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:50:27,811 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:50:27,813 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:50:27,832 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:50:27,833 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:50:27,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:50:27,836 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:50:27,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:50:27,845 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:50:27,846 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:50:27,847 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:50:27,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:50:27,856 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:50:27,857 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:50:27,861 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:50:27,862 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:50:27,863 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:50:27,866 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:50:27,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:50:27,875 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:50:27,876 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:50:27,877 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:50:27,882 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:50:27,882 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:50:27,882 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:50:27,883 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:50:27,884 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:50:27,885 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:50:27,886 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:50:27,887 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:50:27,887 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:50:27,888 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:50:27,888 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:50:27,888 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:50:27,889 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:50:27,890 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:50:27,890 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:50:27,915 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:50:27,915 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:50:27,916 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:50:27,917 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:50:27,917 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:50:27,917 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:50:27,917 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:50:27,917 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:50:27,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:50:27,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:50:27,995 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:50:27,997 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:50:27,998 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:50:27,999 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2018-07-23 13:50:28,000 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl' [2018-07-23 13:50:28,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:50:28,060 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:50:28,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:50:28,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:50:28,061 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:50:28,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:28" (1/1) ... [2018-07-23 13:50:28,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:28" (1/1) ... [2018-07-23 13:50:28,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:28" (1/1) ... [2018-07-23 13:50:28,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:28" (1/1) ... [2018-07-23 13:50:28,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:28" (1/1) ... [2018-07-23 13:50:28,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:28" (1/1) ... [2018-07-23 13:50:28,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:28" (1/1) ... [2018-07-23 13:50:28,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:50:28,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:50:28,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:50:28,106 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:50:28,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:28" (1/1) ... [2018-07-23 13:50:28,194 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-23 13:50:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-23 13:50:28,195 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-23 13:50:28,357 INFO L258 CfgBuilder]: Using library mode [2018-07-23 13:50:28,358 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:50:28 BoogieIcfgContainer [2018-07-23 13:50:28,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:50:28,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:50:28,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:50:28,363 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:50:28,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:28" (1/2) ... [2018-07-23 13:50:28,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630028f9 and model type BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:50:28, skipping insertion in model container [2018-07-23 13:50:28,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:50:28" (2/2) ... [2018-07-23 13:50:28,367 INFO L112 eAbstractionObserver]: Analyzing ICFG BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2018-07-23 13:50:28,376 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:50:28,384 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-07-23 13:50:28,435 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:50:28,436 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:50:28,436 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:50:28,436 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:50:28,436 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:50:28,437 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:50:28,437 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:50:28,437 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:50:28,437 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:50:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-07-23 13:50:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-23 13:50:28,462 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:28,463 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-23 13:50:28,464 INFO L414 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:28,470 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2018-07-23 13:50:28,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,547 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:50:28,548 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:50:28,550 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,551 INFO L185 omatonBuilderFactory]: Interpolants [10#true, 11#false, 12#(<= x 0)] [2018-07-23 13:50:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,553 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:50:28,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:50:28,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:50:28,574 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-07-23 13:50:28,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:28,604 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:50:28,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:50:28,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-23 13:50:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:28,619 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:50:28,619 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:50:28,630 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:50:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:50:28,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 13:50:28,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:50:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:50:28,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2018-07-23 13:50:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:28,691 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:50:28,691 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:50:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:50:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:50:28,692 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:28,692 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:50:28,692 INFO L414 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:28,693 INFO L82 PathProgramCache]: Analyzing trace with hash 943126, now seen corresponding path program 1 times [2018-07-23 13:50:28,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,732 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:28,735 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:50:28,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,736 INFO L185 omatonBuilderFactory]: Interpolants [53#true, 54#false, 55#(<= x 0), 56#(<= x 1)] [2018-07-23 13:50:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,741 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:50:28,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:50:28,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:50:28,743 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-23 13:50:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:28,780 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:50:28,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:50:28,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 13:50:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:28,782 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:50:28,782 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:50:28,783 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07-23 13:50:28,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:50:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 13:50:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 13:50:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-23 13:50:28,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2018-07-23 13:50:28,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:28,787 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-23 13:50:28,787 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:50:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-23 13:50:28,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:50:28,788 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:28,788 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-23 13:50:28,788 INFO L414 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:28,789 INFO L82 PathProgramCache]: Analyzing trace with hash 29244576, now seen corresponding path program 2 times [2018-07-23 13:50:28,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,822 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:28,822 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:50:28,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,823 INFO L185 omatonBuilderFactory]: Interpolants [97#true, 98#false, 99#(<= x 0), 100#(<= x 1), 101#(<= x 2)] [2018-07-23 13:50:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,823 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:50:28,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:50:28,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:50:28,824 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2018-07-23 13:50:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:28,838 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:50:28,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:50:28,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-23 13:50:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:28,839 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:50:28,839 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 13:50:28,840 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-07-23 13:50:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 13:50:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 13:50:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:50:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:50:28,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2018-07-23 13:50:28,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:28,844 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:50:28,844 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:50:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:50:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:50:28,845 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:28,845 INFO L357 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-23 13:50:28,845 INFO L414 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:28,846 INFO L82 PathProgramCache]: Analyzing trace with hash 906589526, now seen corresponding path program 3 times [2018-07-23 13:50:28,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,900 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:28,900 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:50:28,900 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,901 INFO L185 omatonBuilderFactory]: Interpolants [146#true, 147#false, 148#(<= x 0), 149#(<= x 1), 150#(<= x 2), 151#(<= x 3)] [2018-07-23 13:50:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:28,901 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:50:28,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:50:28,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:50:28,902 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-07-23 13:50:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:28,918 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 13:50:28,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:50:28,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 13:50:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:28,919 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:50:28,919 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:50:28,920 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-07-23 13:50:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:50:28,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-23 13:50:28,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-23 13:50:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-23 13:50:28,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2018-07-23 13:50:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:28,927 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-23 13:50:28,927 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:50:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-23 13:50:28,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:50:28,928 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:28,928 INFO L357 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-23 13:50:28,928 INFO L414 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:28,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1960488096, now seen corresponding path program 4 times [2018-07-23 13:50:28,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,016 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:29,017 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:50:29,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,021 INFO L185 omatonBuilderFactory]: Interpolants [200#true, 201#false, 202#(<= x 0), 203#(<= x 1), 204#(<= x 2), 205#(<= x 3), 206#(<= x 4)] [2018-07-23 13:50:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,021 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:50:29,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:50:29,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:50:29,022 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-07-23 13:50:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:29,039 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:50:29,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:50:29,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-23 13:50:29,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:29,040 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:50:29,040 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:50:29,041 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-07-23 13:50:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:50:29,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:50:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:50:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:50:29,044 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2018-07-23 13:50:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:29,045 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:50:29,045 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:50:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:50:29,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:50:29,045 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:29,046 INFO L357 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-23 13:50:29,046 INFO L414 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:29,046 INFO L82 PathProgramCache]: Analyzing trace with hash -645581162, now seen corresponding path program 5 times [2018-07-23 13:50:29,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,142 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:29,142 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:50:29,142 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,143 INFO L185 omatonBuilderFactory]: Interpolants [259#true, 260#false, 261#(<= x 0), 262#(<= x 1), 263#(<= x 2), 264#(<= x 3), 265#(<= x 4), 266#(<= x 5)] [2018-07-23 13:50:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,146 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:50:29,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:50:29,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:50:29,148 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-07-23 13:50:29,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:29,165 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 13:50:29,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:50:29,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:50:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:29,166 INFO L225 Difference]: With dead ends: 16 [2018-07-23 13:50:29,166 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:50:29,167 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-07-23 13:50:29,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:50:29,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-23 13:50:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 13:50:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-23 13:50:29,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2018-07-23 13:50:29,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:29,171 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-23 13:50:29,171 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:50:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-23 13:50:29,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:50:29,172 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:29,172 INFO L357 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-23 13:50:29,172 INFO L414 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:29,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1461828128, now seen corresponding path program 6 times [2018-07-23 13:50:29,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,266 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:29,266 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:50:29,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,267 INFO L185 omatonBuilderFactory]: Interpolants [323#true, 324#false, 325#(<= x 0), 326#(<= x 1), 327#(<= x 2), 328#(<= x 3), 329#(<= x 4), 330#(<= x 5), 331#(<= x 6)] [2018-07-23 13:50:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,268 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:50:29,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:50:29,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:50:29,273 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-07-23 13:50:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:29,307 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:50:29,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:50:29,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-23 13:50:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:29,308 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:50:29,311 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 13:50:29,312 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-07-23 13:50:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 13:50:29,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 13:50:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:50:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:50:29,320 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2018-07-23 13:50:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:29,320 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:50:29,320 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:50:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:50:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:50:29,321 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:29,321 INFO L357 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-23 13:50:29,321 INFO L414 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:29,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1927960618, now seen corresponding path program 7 times [2018-07-23 13:50:29,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,405 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:29,406 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:50:29,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,409 INFO L185 omatonBuilderFactory]: Interpolants [400#(<= x 6), 401#(<= x 7), 392#true, 393#false, 394#(<= x 0), 395#(<= x 1), 396#(<= x 2), 397#(<= x 3), 398#(<= x 4), 399#(<= x 5)] [2018-07-23 13:50:29,409 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,410 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:50:29,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:50:29,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:50:29,411 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-07-23 13:50:29,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:29,429 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 13:50:29,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:50:29,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-23 13:50:29,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:29,430 INFO L225 Difference]: With dead ends: 18 [2018-07-23 13:50:29,430 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:50:29,431 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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-07-23 13:50:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:50:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-23 13:50:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 13:50:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-23 13:50:29,435 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2018-07-23 13:50:29,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:29,436 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-23 13:50:29,436 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:50:29,436 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-23 13:50:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:50:29,437 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:29,437 INFO L357 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-23 13:50:29,437 INFO L414 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:29,438 INFO L82 PathProgramCache]: Analyzing trace with hash 362770656, now seen corresponding path program 8 times [2018-07-23 13:50:29,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,512 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:29,512 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:50:29,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,513 INFO L185 omatonBuilderFactory]: Interpolants [466#true, 467#false, 468#(<= x 0), 469#(<= x 1), 470#(<= x 2), 471#(<= x 3), 472#(<= x 4), 473#(<= x 5), 474#(<= x 6), 475#(<= x 7), 476#(<= x 8)] [2018-07-23 13:50:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,514 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:50:29,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:50:29,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:50:29,515 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2018-07-23 13:50:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:29,532 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 13:50:29,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:50:29,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-23 13:50:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:29,533 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:50:29,533 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:50:29,534 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-07-23 13:50:29,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:50:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 13:50:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:50:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:50:29,538 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-07-23 13:50:29,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:29,539 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:50:29,539 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:50:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:50:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:50:29,539 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:29,540 INFO L357 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-23 13:50:29,540 INFO L414 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:29,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1639003882, now seen corresponding path program 9 times [2018-07-23 13:50:29,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,618 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:29,620 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:50:29,620 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,621 INFO L185 omatonBuilderFactory]: Interpolants [545#true, 546#false, 547#(<= x 0), 548#(<= x 1), 549#(<= x 2), 550#(<= x 3), 551#(<= x 4), 552#(<= x 5), 553#(<= x 6), 554#(<= x 7), 555#(<= x 8), 556#(<= x 9)] [2018-07-23 13:50:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,621 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:50:29,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:50:29,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:50:29,628 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-07-23 13:50:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:29,648 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-23 13:50:29,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:50:29,649 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-23 13:50:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:29,649 INFO L225 Difference]: With dead ends: 20 [2018-07-23 13:50:29,650 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:50:29,650 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 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-07-23 13:50:29,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:50:29,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 13:50:29,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 13:50:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-23 13:50:29,654 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2018-07-23 13:50:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:29,655 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-23 13:50:29,655 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:50:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-23 13:50:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:50:29,656 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:29,656 INFO L357 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-23 13:50:29,656 INFO L414 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:29,657 INFO L82 PathProgramCache]: Analyzing trace with hash 730494880, now seen corresponding path program 10 times [2018-07-23 13:50:29,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,740 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:29,740 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:50:29,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,741 INFO L185 omatonBuilderFactory]: Interpolants [640#(<= x 9), 641#(<= x 10), 629#true, 630#false, 631#(<= x 0), 632#(<= x 1), 633#(<= x 2), 634#(<= x 3), 635#(<= x 4), 636#(<= x 5), 637#(<= x 6), 638#(<= x 7), 639#(<= x 8)] [2018-07-23 13:50:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,742 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:50:29,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:50:29,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:50:29,743 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2018-07-23 13:50:29,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:29,759 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 13:50:29,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:50:29,759 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-23 13:50:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:29,760 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:50:29,760 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 13:50:29,761 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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-07-23 13:50:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 13:50:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 13:50:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 13:50:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 13:50:29,766 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-07-23 13:50:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:29,766 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 13:50:29,766 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:50:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 13:50:29,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:50:29,767 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:29,768 INFO L357 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-23 13:50:29,768 INFO L414 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:29,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1170512470, now seen corresponding path program 11 times [2018-07-23 13:50:29,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,854 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:29,854 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:50:29,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,855 INFO L185 omatonBuilderFactory]: Interpolants [718#true, 719#false, 720#(<= x 0), 721#(<= x 1), 722#(<= x 2), 723#(<= x 3), 724#(<= x 4), 725#(<= x 5), 726#(<= x 6), 727#(<= x 7), 728#(<= x 8), 729#(<= x 9), 730#(<= x 10), 731#(<= x 11)] [2018-07-23 13:50:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,856 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:50:29,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:50:29,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:50:29,859 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 14 states. [2018-07-23 13:50:29,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:29,876 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-23 13:50:29,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:50:29,877 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-23 13:50:29,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:29,880 INFO L225 Difference]: With dead ends: 22 [2018-07-23 13:50:29,881 INFO L226 Difference]: Without dead ends: 18 [2018-07-23 13:50:29,881 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 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-07-23 13:50:29,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-23 13:50:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-23 13:50:29,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-23 13:50:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-23 13:50:29,889 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2018-07-23 13:50:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:29,890 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-23 13:50:29,891 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:50:29,891 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-23 13:50:29,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:50:29,892 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:29,892 INFO L357 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-23 13:50:29,892 INFO L414 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:29,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1926155872, now seen corresponding path program 12 times [2018-07-23 13:50:29,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,961 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:29,962 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:50:29,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,963 INFO L185 omatonBuilderFactory]: Interpolants [812#true, 813#false, 814#(<= x 0), 815#(<= x 1), 816#(<= x 2), 817#(<= x 3), 818#(<= x 4), 819#(<= x 5), 820#(<= x 6), 821#(<= x 7), 822#(<= x 8), 823#(<= x 9), 824#(<= x 10), 825#(<= x 11), 826#(<= x 12)] [2018-07-23 13:50:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:29,963 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:50:29,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:50:29,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:50:29,965 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2018-07-23 13:50:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:29,985 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 13:50:29,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:50:29,985 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-07-23 13:50:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:29,989 INFO L225 Difference]: With dead ends: 23 [2018-07-23 13:50:29,989 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 13:50:29,991 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 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-07-23 13:50:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 13:50:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-23 13:50:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:50:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 13:50:30,004 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2018-07-23 13:50:30,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:30,005 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 13:50:30,005 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:50:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 13:50:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:50:30,006 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:30,007 INFO L357 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-07-23 13:50:30,007 INFO L414 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:30,007 INFO L82 PathProgramCache]: Analyzing trace with hash -418702442, now seen corresponding path program 13 times [2018-07-23 13:50:30,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,093 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:30,094 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:50:30,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,096 INFO L185 omatonBuilderFactory]: Interpolants [911#true, 912#false, 913#(<= x 0), 914#(<= x 1), 915#(<= x 2), 916#(<= x 3), 917#(<= x 4), 918#(<= x 5), 919#(<= x 6), 920#(<= x 7), 921#(<= x 8), 922#(<= x 9), 923#(<= x 10), 924#(<= x 11), 925#(<= x 12), 926#(<= x 13)] [2018-07-23 13:50:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,097 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:50:30,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:50:30,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:50:30,098 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2018-07-23 13:50:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:30,114 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-23 13:50:30,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:50:30,115 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-07-23 13:50:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:30,116 INFO L225 Difference]: With dead ends: 24 [2018-07-23 13:50:30,116 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 13:50:30,116 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 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-07-23 13:50:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 13:50:30,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-23 13:50:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 13:50:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-23 13:50:30,121 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2018-07-23 13:50:30,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:30,121 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-23 13:50:30,121 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:50:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-23 13:50:30,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:50:30,122 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:30,122 INFO L357 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-07-23 13:50:30,123 INFO L414 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:30,123 INFO L82 PathProgramCache]: Analyzing trace with hash -94866144, now seen corresponding path program 14 times [2018-07-23 13:50:30,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,188 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:30,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:50:30,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,189 INFO L185 omatonBuilderFactory]: Interpolants [1024#(<= x 7), 1025#(<= x 8), 1026#(<= x 9), 1027#(<= x 10), 1028#(<= x 11), 1029#(<= x 12), 1030#(<= x 13), 1031#(<= x 14), 1015#true, 1016#false, 1017#(<= x 0), 1018#(<= x 1), 1019#(<= x 2), 1020#(<= x 3), 1021#(<= x 4), 1022#(<= x 5), 1023#(<= x 6)] [2018-07-23 13:50:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,190 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:50:30,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:50:30,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:50:30,191 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 17 states. [2018-07-23 13:50:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:30,206 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-23 13:50:30,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:50:30,206 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-07-23 13:50:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:30,207 INFO L225 Difference]: With dead ends: 25 [2018-07-23 13:50:30,207 INFO L226 Difference]: Without dead ends: 21 [2018-07-23 13:50:30,208 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 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-07-23 13:50:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-23 13:50:30,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-23 13:50:30,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 13:50:30,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-23 13:50:30,212 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2018-07-23 13:50:30,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:30,212 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-23 13:50:30,212 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:50:30,212 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-23 13:50:30,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:50:30,213 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:30,213 INFO L357 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-07-23 13:50:30,213 INFO L414 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:30,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1354124502, now seen corresponding path program 15 times [2018-07-23 13:50:30,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,284 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:30,285 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 13:50:30,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,286 INFO L185 omatonBuilderFactory]: Interpolants [1124#true, 1125#false, 1126#(<= x 0), 1127#(<= x 1), 1128#(<= x 2), 1129#(<= x 3), 1130#(<= x 4), 1131#(<= x 5), 1132#(<= x 6), 1133#(<= x 7), 1134#(<= x 8), 1135#(<= x 9), 1136#(<= x 10), 1137#(<= x 11), 1138#(<= x 12), 1139#(<= x 13), 1140#(<= x 14), 1141#(<= x 15)] [2018-07-23 13:50:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,286 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 13:50:30,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 13:50:30,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:50:30,288 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 18 states. [2018-07-23 13:50:30,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:30,310 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-23 13:50:30,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:50:30,310 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-07-23 13:50:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:30,311 INFO L225 Difference]: With dead ends: 26 [2018-07-23 13:50:30,311 INFO L226 Difference]: Without dead ends: 22 [2018-07-23 13:50:30,316 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 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-07-23 13:50:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-23 13:50:30,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-23 13:50:30,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-23 13:50:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-23 13:50:30,321 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2018-07-23 13:50:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:30,321 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-23 13:50:30,326 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 13:50:30,327 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-23 13:50:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:50:30,327 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:30,327 INFO L357 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-07-23 13:50:30,328 INFO L414 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:30,328 INFO L82 PathProgramCache]: Analyzing trace with hash -971805728, now seen corresponding path program 16 times [2018-07-23 13:50:30,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,408 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:30,408 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 13:50:30,408 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,409 INFO L185 omatonBuilderFactory]: Interpolants [1248#(<= x 8), 1249#(<= x 9), 1250#(<= x 10), 1251#(<= x 11), 1252#(<= x 12), 1253#(<= x 13), 1254#(<= x 14), 1255#(<= x 15), 1256#(<= x 16), 1238#true, 1239#false, 1240#(<= x 0), 1241#(<= x 1), 1242#(<= x 2), 1243#(<= x 3), 1244#(<= x 4), 1245#(<= x 5), 1246#(<= x 6), 1247#(<= x 7)] [2018-07-23 13:50:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,410 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 13:50:30,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 13:50:30,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:50:30,411 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2018-07-23 13:50:30,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:30,427 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-23 13:50:30,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:50:30,427 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-07-23 13:50:30,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:30,428 INFO L225 Difference]: With dead ends: 27 [2018-07-23 13:50:30,428 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 13:50:30,429 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 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-07-23 13:50:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 13:50:30,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-23 13:50:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 13:50:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-23 13:50:30,433 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2018-07-23 13:50:30,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:30,434 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-23 13:50:30,434 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 13:50:30,434 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-23 13:50:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:50:30,435 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:30,435 INFO L357 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-07-23 13:50:30,435 INFO L414 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash -61198826, now seen corresponding path program 17 times [2018-07-23 13:50:30,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,518 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:30,518 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 13:50:30,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:30,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,519 INFO L185 omatonBuilderFactory]: Interpolants [1376#(<= x 17), 1357#true, 1358#false, 1359#(<= x 0), 1360#(<= x 1), 1361#(<= x 2), 1362#(<= x 3), 1363#(<= x 4), 1364#(<= x 5), 1365#(<= x 6), 1366#(<= x 7), 1367#(<= x 8), 1368#(<= x 9), 1369#(<= x 10), 1370#(<= x 11), 1371#(<= x 12), 1372#(<= x 13), 1373#(<= x 14), 1374#(<= x 15), 1375#(<= x 16)] [2018-07-23 13:50:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,520 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 13:50:30,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 13:50:30,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:50:30,521 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 20 states. [2018-07-23 13:50:30,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:30,536 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-23 13:50:30,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:50:30,536 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-07-23 13:50:30,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:30,537 INFO L225 Difference]: With dead ends: 28 [2018-07-23 13:50:30,537 INFO L226 Difference]: Without dead ends: 24 [2018-07-23 13:50:30,538 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 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-07-23 13:50:30,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-23 13:50:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-23 13:50:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-23 13:50:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-23 13:50:30,542 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2018-07-23 13:50:30,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:30,543 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-23 13:50:30,543 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 13:50:30,543 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-23 13:50:30,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:50:30,544 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:30,544 INFO L357 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-07-23 13:50:30,544 INFO L414 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:30,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1897155936, now seen corresponding path program 18 times [2018-07-23 13:50:30,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:30,630 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,631 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:30,631 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 13:50:30,631 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,632 INFO L185 omatonBuilderFactory]: Interpolants [1481#true, 1482#false, 1483#(<= x 0), 1484#(<= x 1), 1485#(<= x 2), 1486#(<= x 3), 1487#(<= x 4), 1488#(<= x 5), 1489#(<= x 6), 1490#(<= x 7), 1491#(<= x 8), 1492#(<= x 9), 1493#(<= x 10), 1494#(<= x 11), 1495#(<= x 12), 1496#(<= x 13), 1497#(<= x 14), 1498#(<= x 15), 1499#(<= x 16), 1500#(<= x 17), 1501#(<= x 18)] [2018-07-23 13:50:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,633 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 13:50:30,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 13:50:30,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:50:30,634 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2018-07-23 13:50:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:30,653 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-23 13:50:30,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:50:30,654 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-07-23 13:50:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:30,655 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:50:30,655 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 13:50:30,656 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 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-07-23 13:50:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 13:50:30,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 13:50:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 13:50:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-23 13:50:30,660 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2018-07-23 13:50:30,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:30,660 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-23 13:50:30,660 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 13:50:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-23 13:50:30,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:50:30,661 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:30,661 INFO L357 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-07-23 13:50:30,662 INFO L414 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:30,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1317715798, now seen corresponding path program 19 times [2018-07-23 13:50:30,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,756 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:30,756 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 13:50:30,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,766 INFO L185 omatonBuilderFactory]: Interpolants [1610#true, 1611#false, 1612#(<= x 0), 1613#(<= x 1), 1614#(<= x 2), 1615#(<= x 3), 1616#(<= x 4), 1617#(<= x 5), 1618#(<= x 6), 1619#(<= x 7), 1620#(<= x 8), 1621#(<= x 9), 1622#(<= x 10), 1623#(<= x 11), 1624#(<= x 12), 1625#(<= x 13), 1626#(<= x 14), 1627#(<= x 15), 1628#(<= x 16), 1629#(<= x 17), 1630#(<= x 18), 1631#(<= x 19)] [2018-07-23 13:50:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,767 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 13:50:30,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 13:50:30,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:50:30,770 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2018-07-23 13:50:30,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:30,792 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-23 13:50:30,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:50:30,793 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-07-23 13:50:30,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:30,793 INFO L225 Difference]: With dead ends: 30 [2018-07-23 13:50:30,794 INFO L226 Difference]: Without dead ends: 26 [2018-07-23 13:50:30,794 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 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-07-23 13:50:30,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-23 13:50:30,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-23 13:50:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-23 13:50:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-23 13:50:30,798 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2018-07-23 13:50:30,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:30,799 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-23 13:50:30,799 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 13:50:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-23 13:50:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:50:30,800 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:30,800 INFO L357 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-07-23 13:50:30,800 INFO L414 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:30,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2100475552, now seen corresponding path program 20 times [2018-07-23 13:50:30,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,898 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:30,898 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 13:50:30,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,899 INFO L185 omatonBuilderFactory]: Interpolants [1760#(<= x 14), 1761#(<= x 15), 1762#(<= x 16), 1763#(<= x 17), 1764#(<= x 18), 1765#(<= x 19), 1766#(<= x 20), 1744#true, 1745#false, 1746#(<= x 0), 1747#(<= x 1), 1748#(<= x 2), 1749#(<= x 3), 1750#(<= x 4), 1751#(<= x 5), 1752#(<= x 6), 1753#(<= x 7), 1754#(<= x 8), 1755#(<= x 9), 1756#(<= x 10), 1757#(<= x 11), 1758#(<= x 12), 1759#(<= x 13)] [2018-07-23 13:50:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:30,900 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 13:50:30,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 13:50:30,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:50:30,901 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2018-07-23 13:50:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:30,920 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-23 13:50:30,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:50:30,920 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-07-23 13:50:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:30,921 INFO L225 Difference]: With dead ends: 31 [2018-07-23 13:50:30,921 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 13:50:30,922 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 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-07-23 13:50:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 13:50:30,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-23 13:50:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 13:50:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-23 13:50:30,927 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2018-07-23 13:50:30,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:30,928 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-23 13:50:30,928 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 13:50:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-23 13:50:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 13:50:30,929 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:30,929 INFO L357 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-07-23 13:50:30,931 INFO L414 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:30,931 INFO L82 PathProgramCache]: Analyzing trace with hash -690225002, now seen corresponding path program 21 times [2018-07-23 13:50:30,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,052 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:31,052 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 13:50:31,052 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,053 INFO L185 omatonBuilderFactory]: Interpolants [1888#(<= x 3), 1889#(<= x 4), 1890#(<= x 5), 1891#(<= x 6), 1892#(<= x 7), 1893#(<= x 8), 1894#(<= x 9), 1895#(<= x 10), 1896#(<= x 11), 1897#(<= x 12), 1898#(<= x 13), 1899#(<= x 14), 1900#(<= x 15), 1901#(<= x 16), 1902#(<= x 17), 1903#(<= x 18), 1904#(<= x 19), 1905#(<= x 20), 1906#(<= x 21), 1883#true, 1884#false, 1885#(<= x 0), 1886#(<= x 1), 1887#(<= x 2)] [2018-07-23 13:50:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,054 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 13:50:31,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 13:50:31,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:50:31,056 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2018-07-23 13:50:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:31,082 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-23 13:50:31,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:50:31,082 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-07-23 13:50:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:31,083 INFO L225 Difference]: With dead ends: 32 [2018-07-23 13:50:31,083 INFO L226 Difference]: Without dead ends: 28 [2018-07-23 13:50:31,084 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 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-07-23 13:50:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-23 13:50:31,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-23 13:50:31,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-23 13:50:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-23 13:50:31,093 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2018-07-23 13:50:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:31,096 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-23 13:50:31,096 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 13:50:31,097 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-23 13:50:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:50:31,098 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:31,099 INFO L357 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-07-23 13:50:31,099 INFO L414 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash 77869088, now seen corresponding path program 22 times [2018-07-23 13:50:31,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,238 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:31,238 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 13:50:31,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,239 INFO L185 omatonBuilderFactory]: Interpolants [2048#(<= x 19), 2049#(<= x 20), 2050#(<= x 21), 2051#(<= x 22), 2027#true, 2028#false, 2029#(<= x 0), 2030#(<= x 1), 2031#(<= x 2), 2032#(<= x 3), 2033#(<= x 4), 2034#(<= x 5), 2035#(<= x 6), 2036#(<= x 7), 2037#(<= x 8), 2038#(<= x 9), 2039#(<= x 10), 2040#(<= x 11), 2041#(<= x 12), 2042#(<= x 13), 2043#(<= x 14), 2044#(<= x 15), 2045#(<= x 16), 2046#(<= x 17), 2047#(<= x 18)] [2018-07-23 13:50:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,240 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 13:50:31,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 13:50:31,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:50:31,243 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2018-07-23 13:50:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:31,273 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-23 13:50:31,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:50:31,273 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-07-23 13:50:31,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:31,274 INFO L225 Difference]: With dead ends: 33 [2018-07-23 13:50:31,274 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 13:50:31,275 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:50:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 13:50:31,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-23 13:50:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 13:50:31,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 13:50:31,281 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2018-07-23 13:50:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:31,282 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 13:50:31,282 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 13:50:31,282 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 13:50:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:50:31,283 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:31,283 INFO L357 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-07-23 13:50:31,283 INFO L414 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:31,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1881017898, now seen corresponding path program 23 times [2018-07-23 13:50:31,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,451 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:31,451 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 13:50:31,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,452 INFO L185 omatonBuilderFactory]: Interpolants [2176#true, 2177#false, 2178#(<= x 0), 2179#(<= x 1), 2180#(<= x 2), 2181#(<= x 3), 2182#(<= x 4), 2183#(<= x 5), 2184#(<= x 6), 2185#(<= x 7), 2186#(<= x 8), 2187#(<= x 9), 2188#(<= x 10), 2189#(<= x 11), 2190#(<= x 12), 2191#(<= x 13), 2192#(<= x 14), 2193#(<= x 15), 2194#(<= x 16), 2195#(<= x 17), 2196#(<= x 18), 2197#(<= x 19), 2198#(<= x 20), 2199#(<= x 21), 2200#(<= x 22), 2201#(<= x 23)] [2018-07-23 13:50:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,456 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 13:50:31,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 13:50:31,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:50:31,458 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2018-07-23 13:50:31,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:31,488 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-23 13:50:31,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:50:31,488 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-07-23 13:50:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:31,489 INFO L225 Difference]: With dead ends: 34 [2018-07-23 13:50:31,489 INFO L226 Difference]: Without dead ends: 30 [2018-07-23 13:50:31,490 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 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-07-23 13:50:31,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-23 13:50:31,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-23 13:50:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-23 13:50:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-23 13:50:31,496 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-07-23 13:50:31,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:31,496 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-23 13:50:31,497 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 13:50:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-23 13:50:31,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-23 13:50:31,497 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:31,498 INFO L357 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-07-23 13:50:31,498 INFO L414 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:31,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1817994976, now seen corresponding path program 24 times [2018-07-23 13:50:31,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,635 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:31,635 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 13:50:31,635 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,636 INFO L185 omatonBuilderFactory]: Interpolants [2330#true, 2331#false, 2332#(<= x 0), 2333#(<= x 1), 2334#(<= x 2), 2335#(<= x 3), 2336#(<= x 4), 2337#(<= x 5), 2338#(<= x 6), 2339#(<= x 7), 2340#(<= x 8), 2341#(<= x 9), 2342#(<= x 10), 2343#(<= x 11), 2344#(<= x 12), 2345#(<= x 13), 2346#(<= x 14), 2347#(<= x 15), 2348#(<= x 16), 2349#(<= x 17), 2350#(<= x 18), 2351#(<= x 19), 2352#(<= x 20), 2353#(<= x 21), 2354#(<= x 22), 2355#(<= x 23), 2356#(<= x 24)] [2018-07-23 13:50:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,637 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 13:50:31,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 13:50:31,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:50:31,638 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2018-07-23 13:50:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:31,661 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-23 13:50:31,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:50:31,662 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-07-23 13:50:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:31,663 INFO L225 Difference]: With dead ends: 35 [2018-07-23 13:50:31,663 INFO L226 Difference]: Without dead ends: 31 [2018-07-23 13:50:31,664 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:50:31,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-23 13:50:31,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-23 13:50:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 13:50:31,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-23 13:50:31,669 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2018-07-23 13:50:31,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:31,670 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-23 13:50:31,670 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 13:50:31,670 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-23 13:50:31,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:50:31,671 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:31,671 INFO L357 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-07-23 13:50:31,671 INFO L414 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:31,672 INFO L82 PathProgramCache]: Analyzing trace with hash 523277078, now seen corresponding path program 25 times [2018-07-23 13:50:31,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,844 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:31,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 13:50:31,845 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,846 INFO L185 omatonBuilderFactory]: Interpolants [2496#(<= x 5), 2497#(<= x 6), 2498#(<= x 7), 2499#(<= x 8), 2500#(<= x 9), 2501#(<= x 10), 2502#(<= x 11), 2503#(<= x 12), 2504#(<= x 13), 2505#(<= x 14), 2506#(<= x 15), 2507#(<= x 16), 2508#(<= x 17), 2509#(<= x 18), 2510#(<= x 19), 2511#(<= x 20), 2512#(<= x 21), 2513#(<= x 22), 2514#(<= x 23), 2515#(<= x 24), 2516#(<= x 25), 2489#true, 2490#false, 2491#(<= x 0), 2492#(<= x 1), 2493#(<= x 2), 2494#(<= x 3), 2495#(<= x 4)] [2018-07-23 13:50:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:31,849 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 13:50:31,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 13:50:31,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:50:31,851 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2018-07-23 13:50:31,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:31,874 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-23 13:50:31,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:50:31,874 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-07-23 13:50:31,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:31,875 INFO L225 Difference]: With dead ends: 36 [2018-07-23 13:50:31,875 INFO L226 Difference]: Without dead ends: 32 [2018-07-23 13:50:31,876 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 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-07-23 13:50:31,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-23 13:50:31,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-23 13:50:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-23 13:50:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-23 13:50:31,880 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2018-07-23 13:50:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:31,882 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-23 13:50:31,882 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 13:50:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-23 13:50:31,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:50:31,883 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:31,884 INFO L357 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-07-23 13:50:31,884 INFO L414 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:31,884 INFO L82 PathProgramCache]: Analyzing trace with hash -958272096, now seen corresponding path program 26 times [2018-07-23 13:50:31,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,055 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:32,055 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 13:50:32,055 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,056 INFO L185 omatonBuilderFactory]: Interpolants [2653#true, 2654#false, 2655#(<= x 0), 2656#(<= x 1), 2657#(<= x 2), 2658#(<= x 3), 2659#(<= x 4), 2660#(<= x 5), 2661#(<= x 6), 2662#(<= x 7), 2663#(<= x 8), 2664#(<= x 9), 2665#(<= x 10), 2666#(<= x 11), 2667#(<= x 12), 2668#(<= x 13), 2669#(<= x 14), 2670#(<= x 15), 2671#(<= x 16), 2672#(<= x 17), 2673#(<= x 18), 2674#(<= x 19), 2675#(<= x 20), 2676#(<= x 21), 2677#(<= x 22), 2678#(<= x 23), 2679#(<= x 24), 2680#(<= x 25), 2681#(<= x 26)] [2018-07-23 13:50:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,057 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 13:50:32,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 13:50:32,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:50:32,059 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-07-23 13:50:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:32,092 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-23 13:50:32,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:50:32,092 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-07-23 13:50:32,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:32,093 INFO L225 Difference]: With dead ends: 37 [2018-07-23 13:50:32,093 INFO L226 Difference]: Without dead ends: 33 [2018-07-23 13:50:32,096 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 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-07-23 13:50:32,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-23 13:50:32,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-23 13:50:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-23 13:50:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-23 13:50:32,105 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2018-07-23 13:50:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:32,106 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-23 13:50:32,106 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 13:50:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-23 13:50:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 13:50:32,106 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:32,107 INFO L357 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-07-23 13:50:32,107 INFO L414 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:32,107 INFO L82 PathProgramCache]: Analyzing trace with hash 358343766, now seen corresponding path program 27 times [2018-07-23 13:50:32,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,287 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:32,287 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 13:50:32,287 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,288 INFO L185 omatonBuilderFactory]: Interpolants [2822#true, 2823#false, 2824#(<= x 0), 2825#(<= x 1), 2826#(<= x 2), 2827#(<= x 3), 2828#(<= x 4), 2829#(<= x 5), 2830#(<= x 6), 2831#(<= x 7), 2832#(<= x 8), 2833#(<= x 9), 2834#(<= x 10), 2835#(<= x 11), 2836#(<= x 12), 2837#(<= x 13), 2838#(<= x 14), 2839#(<= x 15), 2840#(<= x 16), 2841#(<= x 17), 2842#(<= x 18), 2843#(<= x 19), 2844#(<= x 20), 2845#(<= x 21), 2846#(<= x 22), 2847#(<= x 23), 2848#(<= x 24), 2849#(<= x 25), 2850#(<= x 26), 2851#(<= x 27)] [2018-07-23 13:50:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,292 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 13:50:32,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 13:50:32,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:50:32,293 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 30 states. [2018-07-23 13:50:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:32,320 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-23 13:50:32,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:50:32,320 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-07-23 13:50:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:32,321 INFO L225 Difference]: With dead ends: 38 [2018-07-23 13:50:32,321 INFO L226 Difference]: Without dead ends: 34 [2018-07-23 13:50:32,322 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 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-07-23 13:50:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-23 13:50:32,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-23 13:50:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-23 13:50:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-23 13:50:32,330 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2018-07-23 13:50:32,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:32,331 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-23 13:50:32,331 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 13:50:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-23 13:50:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 13:50:32,332 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:32,332 INFO L357 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-07-23 13:50:32,332 INFO L414 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:32,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1776237472, now seen corresponding path program 28 times [2018-07-23 13:50:32,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,499 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:32,499 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 13:50:32,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,500 INFO L185 omatonBuilderFactory]: Interpolants [3008#(<= x 10), 3009#(<= x 11), 3010#(<= x 12), 3011#(<= x 13), 3012#(<= x 14), 3013#(<= x 15), 3014#(<= x 16), 3015#(<= x 17), 3016#(<= x 18), 3017#(<= x 19), 3018#(<= x 20), 3019#(<= x 21), 3020#(<= x 22), 3021#(<= x 23), 3022#(<= x 24), 3023#(<= x 25), 3024#(<= x 26), 3025#(<= x 27), 3026#(<= x 28), 2996#true, 2997#false, 2998#(<= x 0), 2999#(<= x 1), 3000#(<= x 2), 3001#(<= x 3), 3002#(<= x 4), 3003#(<= x 5), 3004#(<= x 6), 3005#(<= x 7), 3006#(<= x 8), 3007#(<= x 9)] [2018-07-23 13:50:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,501 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 13:50:32,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 13:50:32,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:50:32,503 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 31 states. [2018-07-23 13:50:32,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:32,522 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-23 13:50:32,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:50:32,522 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-07-23 13:50:32,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:32,523 INFO L225 Difference]: With dead ends: 39 [2018-07-23 13:50:32,523 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 13:50:32,524 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 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-07-23 13:50:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 13:50:32,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-23 13:50:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-23 13:50:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-23 13:50:32,531 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2018-07-23 13:50:32,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:32,532 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-23 13:50:32,532 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 13:50:32,532 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-23 13:50:32,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 13:50:32,532 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:32,533 INFO L357 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-07-23 13:50:32,533 INFO L414 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:32,533 INFO L82 PathProgramCache]: Analyzing trace with hash 771220886, now seen corresponding path program 29 times [2018-07-23 13:50:32,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,801 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:32,801 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 13:50:32,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,802 INFO L185 omatonBuilderFactory]: Interpolants [3200#(<= x 23), 3201#(<= x 24), 3202#(<= x 25), 3203#(<= x 26), 3204#(<= x 27), 3205#(<= x 28), 3206#(<= x 29), 3175#true, 3176#false, 3177#(<= x 0), 3178#(<= x 1), 3179#(<= x 2), 3180#(<= x 3), 3181#(<= x 4), 3182#(<= x 5), 3183#(<= x 6), 3184#(<= x 7), 3185#(<= x 8), 3186#(<= x 9), 3187#(<= x 10), 3188#(<= x 11), 3189#(<= x 12), 3190#(<= x 13), 3191#(<= x 14), 3192#(<= x 15), 3193#(<= x 16), 3194#(<= x 17), 3195#(<= x 18), 3196#(<= x 19), 3197#(<= x 20), 3198#(<= x 21), 3199#(<= x 22)] [2018-07-23 13:50:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:32,802 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 13:50:32,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 13:50:32,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:50:32,804 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 32 states. [2018-07-23 13:50:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:32,821 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-23 13:50:32,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 13:50:32,822 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-07-23 13:50:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:32,822 INFO L225 Difference]: With dead ends: 40 [2018-07-23 13:50:32,822 INFO L226 Difference]: Without dead ends: 36 [2018-07-23 13:50:32,824 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 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-07-23 13:50:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-23 13:50:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-23 13:50:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-23 13:50:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-23 13:50:32,831 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2018-07-23 13:50:32,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:32,832 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-23 13:50:32,832 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 13:50:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-23 13:50:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-23 13:50:32,832 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:32,832 INFO L357 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-07-23 13:50:32,832 INFO L414 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:32,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1861948640, now seen corresponding path program 30 times [2018-07-23 13:50:32,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,005 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:33,005 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 13:50:33,006 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,006 INFO L185 omatonBuilderFactory]: Interpolants [3359#true, 3360#false, 3361#(<= x 0), 3362#(<= x 1), 3363#(<= x 2), 3364#(<= x 3), 3365#(<= x 4), 3366#(<= x 5), 3367#(<= x 6), 3368#(<= x 7), 3369#(<= x 8), 3370#(<= x 9), 3371#(<= x 10), 3372#(<= x 11), 3373#(<= x 12), 3374#(<= x 13), 3375#(<= x 14), 3376#(<= x 15), 3377#(<= x 16), 3378#(<= x 17), 3379#(<= x 18), 3380#(<= x 19), 3381#(<= x 20), 3382#(<= x 21), 3383#(<= x 22), 3384#(<= x 23), 3385#(<= x 24), 3386#(<= x 25), 3387#(<= x 26), 3388#(<= x 27), 3389#(<= x 28), 3390#(<= x 29), 3391#(<= x 30)] [2018-07-23 13:50:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,007 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 13:50:33,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 13:50:33,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:50:33,008 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 33 states. [2018-07-23 13:50:33,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:33,028 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-23 13:50:33,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:50:33,029 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-07-23 13:50:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:33,029 INFO L225 Difference]: With dead ends: 41 [2018-07-23 13:50:33,029 INFO L226 Difference]: Without dead ends: 37 [2018-07-23 13:50:33,030 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 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-07-23 13:50:33,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-23 13:50:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-23 13:50:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 13:50:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-23 13:50:33,037 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2018-07-23 13:50:33,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:33,037 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-23 13:50:33,037 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 13:50:33,038 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-23 13:50:33,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 13:50:33,038 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:33,038 INFO L357 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-07-23 13:50:33,038 INFO L414 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:33,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1885825322, now seen corresponding path program 31 times [2018-07-23 13:50:33,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,204 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:33,204 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 13:50:33,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:33,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,205 INFO L185 omatonBuilderFactory]: Interpolants [3548#true, 3549#false, 3550#(<= x 0), 3551#(<= x 1), 3552#(<= x 2), 3553#(<= x 3), 3554#(<= x 4), 3555#(<= x 5), 3556#(<= x 6), 3557#(<= x 7), 3558#(<= x 8), 3559#(<= x 9), 3560#(<= x 10), 3561#(<= x 11), 3562#(<= x 12), 3563#(<= x 13), 3564#(<= x 14), 3565#(<= x 15), 3566#(<= x 16), 3567#(<= x 17), 3568#(<= x 18), 3569#(<= x 19), 3570#(<= x 20), 3571#(<= x 21), 3572#(<= x 22), 3573#(<= x 23), 3574#(<= x 24), 3575#(<= x 25), 3576#(<= x 26), 3577#(<= x 27), 3578#(<= x 28), 3579#(<= x 29), 3580#(<= x 30), 3581#(<= x 31)] [2018-07-23 13:50:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,206 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 13:50:33,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 13:50:33,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:50:33,208 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2018-07-23 13:50:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:33,251 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-23 13:50:33,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:50:33,252 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-07-23 13:50:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:33,252 INFO L225 Difference]: With dead ends: 42 [2018-07-23 13:50:33,255 INFO L226 Difference]: Without dead ends: 38 [2018-07-23 13:50:33,257 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 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-07-23 13:50:33,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-23 13:50:33,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-23 13:50:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-23 13:50:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-23 13:50:33,263 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 34 [2018-07-23 13:50:33,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:33,263 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-23 13:50:33,263 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 13:50:33,263 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-23 13:50:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-23 13:50:33,264 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:33,264 INFO L357 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-07-23 13:50:33,264 INFO L414 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:33,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1668964832, now seen corresponding path program 32 times [2018-07-23 13:50:33,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,464 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:33,464 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 13:50:33,464 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,465 INFO L185 omatonBuilderFactory]: Interpolants [3776#(<= x 32), 3742#true, 3743#false, 3744#(<= x 0), 3745#(<= x 1), 3746#(<= x 2), 3747#(<= x 3), 3748#(<= x 4), 3749#(<= x 5), 3750#(<= x 6), 3751#(<= x 7), 3752#(<= x 8), 3753#(<= x 9), 3754#(<= x 10), 3755#(<= x 11), 3756#(<= x 12), 3757#(<= x 13), 3758#(<= x 14), 3759#(<= x 15), 3760#(<= x 16), 3761#(<= x 17), 3762#(<= x 18), 3763#(<= x 19), 3764#(<= x 20), 3765#(<= x 21), 3766#(<= x 22), 3767#(<= x 23), 3768#(<= x 24), 3769#(<= x 25), 3770#(<= x 26), 3771#(<= x 27), 3772#(<= x 28), 3773#(<= x 29), 3774#(<= x 30), 3775#(<= x 31)] [2018-07-23 13:50:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,469 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 13:50:33,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 13:50:33,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:50:33,471 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 35 states. [2018-07-23 13:50:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:33,492 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-23 13:50:33,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 13:50:33,492 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-07-23 13:50:33,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:33,494 INFO L225 Difference]: With dead ends: 43 [2018-07-23 13:50:33,494 INFO L226 Difference]: Without dead ends: 39 [2018-07-23 13:50:33,495 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 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-07-23 13:50:33,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-23 13:50:33,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-23 13:50:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-23 13:50:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-23 13:50:33,499 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2018-07-23 13:50:33,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:33,499 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-23 13:50:33,499 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 13:50:33,499 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-23 13:50:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 13:50:33,500 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:33,500 INFO L357 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-07-23 13:50:33,505 INFO L414 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:33,505 INFO L82 PathProgramCache]: Analyzing trace with hash 198309910, now seen corresponding path program 33 times [2018-07-23 13:50:33,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,693 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:33,694 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 13:50:33,694 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,695 INFO L185 omatonBuilderFactory]: Interpolants [3968#(<= x 25), 3969#(<= x 26), 3970#(<= x 27), 3971#(<= x 28), 3972#(<= x 29), 3973#(<= x 30), 3974#(<= x 31), 3975#(<= x 32), 3976#(<= x 33), 3941#true, 3942#false, 3943#(<= x 0), 3944#(<= x 1), 3945#(<= x 2), 3946#(<= x 3), 3947#(<= x 4), 3948#(<= x 5), 3949#(<= x 6), 3950#(<= x 7), 3951#(<= x 8), 3952#(<= x 9), 3953#(<= x 10), 3954#(<= x 11), 3955#(<= x 12), 3956#(<= x 13), 3957#(<= x 14), 3958#(<= x 15), 3959#(<= x 16), 3960#(<= x 17), 3961#(<= x 18), 3962#(<= x 19), 3963#(<= x 20), 3964#(<= x 21), 3965#(<= x 22), 3966#(<= x 23), 3967#(<= x 24)] [2018-07-23 13:50:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,695 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 13:50:33,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 13:50:33,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:50:33,697 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 36 states. [2018-07-23 13:50:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:33,719 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-23 13:50:33,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 13:50:33,719 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-07-23 13:50:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:33,720 INFO L225 Difference]: With dead ends: 44 [2018-07-23 13:50:33,720 INFO L226 Difference]: Without dead ends: 40 [2018-07-23 13:50:33,721 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 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-07-23 13:50:33,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-23 13:50:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-23 13:50:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-23 13:50:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-23 13:50:33,732 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2018-07-23 13:50:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:33,732 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-23 13:50:33,732 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 13:50:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-23 13:50:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-23 13:50:33,733 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:33,733 INFO L357 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-07-23 13:50:33,733 INFO L414 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:33,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1852647584, now seen corresponding path program 34 times [2018-07-23 13:50:33,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,934 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:33,935 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 13:50:33,935 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,936 INFO L185 omatonBuilderFactory]: Interpolants [4160#(<= x 13), 4161#(<= x 14), 4162#(<= x 15), 4163#(<= x 16), 4164#(<= x 17), 4165#(<= x 18), 4166#(<= x 19), 4167#(<= x 20), 4168#(<= x 21), 4169#(<= x 22), 4170#(<= x 23), 4171#(<= x 24), 4172#(<= x 25), 4173#(<= x 26), 4174#(<= x 27), 4175#(<= x 28), 4176#(<= x 29), 4177#(<= x 30), 4178#(<= x 31), 4179#(<= x 32), 4180#(<= x 33), 4181#(<= x 34), 4145#true, 4146#false, 4147#(<= x 0), 4148#(<= x 1), 4149#(<= x 2), 4150#(<= x 3), 4151#(<= x 4), 4152#(<= x 5), 4153#(<= x 6), 4154#(<= x 7), 4155#(<= x 8), 4156#(<= x 9), 4157#(<= x 10), 4158#(<= x 11), 4159#(<= x 12)] [2018-07-23 13:50:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:33,937 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 13:50:33,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 13:50:33,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:50:33,939 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 37 states. [2018-07-23 13:50:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:33,960 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-23 13:50:33,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 13:50:33,960 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-07-23 13:50:33,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:33,961 INFO L225 Difference]: With dead ends: 45 [2018-07-23 13:50:33,961 INFO L226 Difference]: Without dead ends: 41 [2018-07-23 13:50:33,962 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 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-07-23 13:50:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-23 13:50:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-23 13:50:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-23 13:50:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-23 13:50:33,964 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 37 [2018-07-23 13:50:33,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:33,964 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-23 13:50:33,964 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 13:50:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-23 13:50:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 13:50:33,965 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:33,965 INFO L357 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-07-23 13:50:33,965 INFO L414 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:33,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1597507926, now seen corresponding path program 35 times [2018-07-23 13:50:33,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,159 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:34,162 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 13:50:34,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,162 INFO L185 omatonBuilderFactory]: Interpolants [4354#true, 4355#false, 4356#(<= x 0), 4357#(<= x 1), 4358#(<= x 2), 4359#(<= x 3), 4360#(<= x 4), 4361#(<= x 5), 4362#(<= x 6), 4363#(<= x 7), 4364#(<= x 8), 4365#(<= x 9), 4366#(<= x 10), 4367#(<= x 11), 4368#(<= x 12), 4369#(<= x 13), 4370#(<= x 14), 4371#(<= x 15), 4372#(<= x 16), 4373#(<= x 17), 4374#(<= x 18), 4375#(<= x 19), 4376#(<= x 20), 4377#(<= x 21), 4378#(<= x 22), 4379#(<= x 23), 4380#(<= x 24), 4381#(<= x 25), 4382#(<= x 26), 4383#(<= x 27), 4384#(<= x 28), 4385#(<= x 29), 4386#(<= x 30), 4387#(<= x 31), 4388#(<= x 32), 4389#(<= x 33), 4390#(<= x 34), 4391#(<= x 35)] [2018-07-23 13:50:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,163 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 13:50:34,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 13:50:34,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:50:34,164 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 38 states. [2018-07-23 13:50:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:34,189 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-23 13:50:34,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 13:50:34,189 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-07-23 13:50:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:34,190 INFO L225 Difference]: With dead ends: 46 [2018-07-23 13:50:34,190 INFO L226 Difference]: Without dead ends: 42 [2018-07-23 13:50:34,191 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 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-07-23 13:50:34,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-23 13:50:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-23 13:50:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-23 13:50:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-23 13:50:34,193 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2018-07-23 13:50:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:34,194 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-23 13:50:34,194 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 13:50:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-23 13:50:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-23 13:50:34,195 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:34,195 INFO L357 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-07-23 13:50:34,195 INFO L414 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2016854176, now seen corresponding path program 36 times [2018-07-23 13:50:34,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,387 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:34,387 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 13:50:34,388 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,388 INFO L185 omatonBuilderFactory]: Interpolants [4568#true, 4569#false, 4570#(<= x 0), 4571#(<= x 1), 4572#(<= x 2), 4573#(<= x 3), 4574#(<= x 4), 4575#(<= x 5), 4576#(<= x 6), 4577#(<= x 7), 4578#(<= x 8), 4579#(<= x 9), 4580#(<= x 10), 4581#(<= x 11), 4582#(<= x 12), 4583#(<= x 13), 4584#(<= x 14), 4585#(<= x 15), 4586#(<= x 16), 4587#(<= x 17), 4588#(<= x 18), 4589#(<= x 19), 4590#(<= x 20), 4591#(<= x 21), 4592#(<= x 22), 4593#(<= x 23), 4594#(<= x 24), 4595#(<= x 25), 4596#(<= x 26), 4597#(<= x 27), 4598#(<= x 28), 4599#(<= x 29), 4600#(<= x 30), 4601#(<= x 31), 4602#(<= x 32), 4603#(<= x 33), 4604#(<= x 34), 4605#(<= x 35), 4606#(<= x 36)] [2018-07-23 13:50:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,389 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 13:50:34,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 13:50:34,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:50:34,390 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 39 states. [2018-07-23 13:50:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:34,415 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-23 13:50:34,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:50:34,416 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-07-23 13:50:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:34,416 INFO L225 Difference]: With dead ends: 47 [2018-07-23 13:50:34,417 INFO L226 Difference]: Without dead ends: 43 [2018-07-23 13:50:34,418 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 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-07-23 13:50:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-23 13:50:34,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-23 13:50:34,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-23 13:50:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-23 13:50:34,420 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2018-07-23 13:50:34,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:34,421 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-23 13:50:34,421 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 13:50:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-23 13:50:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 13:50:34,421 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:34,423 INFO L357 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-07-23 13:50:34,423 INFO L414 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:34,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1902037654, now seen corresponding path program 37 times [2018-07-23 13:50:34,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,628 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:34,629 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 13:50:34,629 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,629 INFO L185 omatonBuilderFactory]: Interpolants [4800#(<= x 11), 4801#(<= x 12), 4802#(<= x 13), 4803#(<= x 14), 4804#(<= x 15), 4805#(<= x 16), 4806#(<= x 17), 4807#(<= x 18), 4808#(<= x 19), 4809#(<= x 20), 4810#(<= x 21), 4811#(<= x 22), 4812#(<= x 23), 4813#(<= x 24), 4814#(<= x 25), 4815#(<= x 26), 4816#(<= x 27), 4817#(<= x 28), 4818#(<= x 29), 4819#(<= x 30), 4820#(<= x 31), 4821#(<= x 32), 4822#(<= x 33), 4823#(<= x 34), 4824#(<= x 35), 4825#(<= x 36), 4826#(<= x 37), 4787#true, 4788#false, 4789#(<= x 0), 4790#(<= x 1), 4791#(<= x 2), 4792#(<= x 3), 4793#(<= x 4), 4794#(<= x 5), 4795#(<= x 6), 4796#(<= x 7), 4797#(<= x 8), 4798#(<= x 9), 4799#(<= x 10)] [2018-07-23 13:50:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,630 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 13:50:34,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 13:50:34,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:50:34,631 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 40 states. [2018-07-23 13:50:34,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:34,656 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-23 13:50:34,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 13:50:34,656 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-07-23 13:50:34,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:34,656 INFO L225 Difference]: With dead ends: 48 [2018-07-23 13:50:34,657 INFO L226 Difference]: Without dead ends: 44 [2018-07-23 13:50:34,658 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 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-07-23 13:50:34,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-23 13:50:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-23 13:50:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-23 13:50:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-23 13:50:34,661 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 40 [2018-07-23 13:50:34,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:34,662 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-23 13:50:34,662 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 13:50:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-23 13:50:34,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-23 13:50:34,662 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:34,662 INFO L357 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-07-23 13:50:34,663 INFO L414 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:34,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1166367200, now seen corresponding path program 38 times [2018-07-23 13:50:34,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,869 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:34,869 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 13:50:34,869 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,870 INFO L185 omatonBuilderFactory]: Interpolants [5011#true, 5012#false, 5013#(<= x 0), 5014#(<= x 1), 5015#(<= x 2), 5016#(<= x 3), 5017#(<= x 4), 5018#(<= x 5), 5019#(<= x 6), 5020#(<= x 7), 5021#(<= x 8), 5022#(<= x 9), 5023#(<= x 10), 5024#(<= x 11), 5025#(<= x 12), 5026#(<= x 13), 5027#(<= x 14), 5028#(<= x 15), 5029#(<= x 16), 5030#(<= x 17), 5031#(<= x 18), 5032#(<= x 19), 5033#(<= x 20), 5034#(<= x 21), 5035#(<= x 22), 5036#(<= x 23), 5037#(<= x 24), 5038#(<= x 25), 5039#(<= x 26), 5040#(<= x 27), 5041#(<= x 28), 5042#(<= x 29), 5043#(<= x 30), 5044#(<= x 31), 5045#(<= x 32), 5046#(<= x 33), 5047#(<= x 34), 5048#(<= x 35), 5049#(<= x 36), 5050#(<= x 37), 5051#(<= x 38)] [2018-07-23 13:50:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:34,871 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 13:50:34,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 13:50:34,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:50:34,872 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 41 states. [2018-07-23 13:50:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:34,899 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-23 13:50:34,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 13:50:34,900 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-07-23 13:50:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:34,900 INFO L225 Difference]: With dead ends: 49 [2018-07-23 13:50:34,900 INFO L226 Difference]: Without dead ends: 45 [2018-07-23 13:50:34,901 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 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-07-23 13:50:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-23 13:50:34,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-23 13:50:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-23 13:50:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-23 13:50:34,904 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2018-07-23 13:50:34,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:34,905 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-23 13:50:34,905 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 13:50:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-23 13:50:34,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 13:50:34,905 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:34,905 INFO L357 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-07-23 13:50:34,906 INFO L414 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:34,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1797637162, now seen corresponding path program 39 times [2018-07-23 13:50:34,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:35,129 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:35,130 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 13:50:35,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:35,131 INFO L185 omatonBuilderFactory]: Interpolants [5248#(<= x 6), 5249#(<= x 7), 5250#(<= x 8), 5251#(<= x 9), 5252#(<= x 10), 5253#(<= x 11), 5254#(<= x 12), 5255#(<= x 13), 5256#(<= x 14), 5257#(<= x 15), 5258#(<= x 16), 5259#(<= x 17), 5260#(<= x 18), 5261#(<= x 19), 5262#(<= x 20), 5263#(<= x 21), 5264#(<= x 22), 5265#(<= x 23), 5266#(<= x 24), 5267#(<= x 25), 5268#(<= x 26), 5269#(<= x 27), 5270#(<= x 28), 5271#(<= x 29), 5272#(<= x 30), 5273#(<= x 31), 5274#(<= x 32), 5275#(<= x 33), 5276#(<= x 34), 5277#(<= x 35), 5278#(<= x 36), 5279#(<= x 37), 5280#(<= x 38), 5281#(<= x 39), 5240#true, 5241#false, 5242#(<= x 0), 5243#(<= x 1), 5244#(<= x 2), 5245#(<= x 3), 5246#(<= x 4), 5247#(<= x 5)] [2018-07-23 13:50:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:35,132 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 13:50:35,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 13:50:35,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 13:50:35,134 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 42 states. [2018-07-23 13:50:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:35,160 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-23 13:50:35,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 13:50:35,161 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-07-23 13:50:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:35,161 INFO L225 Difference]: With dead ends: 50 [2018-07-23 13:50:35,161 INFO L226 Difference]: Without dead ends: 46 [2018-07-23 13:50:35,162 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 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-07-23 13:50:35,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-23 13:50:35,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-23 13:50:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-23 13:50:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-23 13:50:35,165 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2018-07-23 13:50:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:35,165 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-23 13:50:35,165 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 13:50:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-23 13:50:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-23 13:50:35,166 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:35,166 INFO L357 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-07-23 13:50:35,166 INFO L414 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:35,166 INFO L82 PathProgramCache]: Analyzing trace with hash 107830496, now seen corresponding path program 40 times [2018-07-23 13:50:35,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:35,390 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:35,390 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 13:50:35,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:35,391 INFO L185 omatonBuilderFactory]: Interpolants [5504#(<= x 28), 5505#(<= x 29), 5506#(<= x 30), 5507#(<= x 31), 5508#(<= x 32), 5509#(<= x 33), 5510#(<= x 34), 5511#(<= x 35), 5512#(<= x 36), 5513#(<= x 37), 5514#(<= x 38), 5515#(<= x 39), 5516#(<= x 40), 5474#true, 5475#false, 5476#(<= x 0), 5477#(<= x 1), 5478#(<= x 2), 5479#(<= x 3), 5480#(<= x 4), 5481#(<= x 5), 5482#(<= x 6), 5483#(<= x 7), 5484#(<= x 8), 5485#(<= x 9), 5486#(<= x 10), 5487#(<= x 11), 5488#(<= x 12), 5489#(<= x 13), 5490#(<= x 14), 5491#(<= x 15), 5492#(<= x 16), 5493#(<= x 17), 5494#(<= x 18), 5495#(<= x 19), 5496#(<= x 20), 5497#(<= x 21), 5498#(<= x 22), 5499#(<= x 23), 5500#(<= x 24), 5501#(<= x 25), 5502#(<= x 26), 5503#(<= x 27)] [2018-07-23 13:50:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:35,392 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 13:50:35,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 13:50:35,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:50:35,394 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 43 states. [2018-07-23 13:50:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:35,418 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-23 13:50:35,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 13:50:35,419 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-07-23 13:50:35,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:35,419 INFO L225 Difference]: With dead ends: 51 [2018-07-23 13:50:35,420 INFO L226 Difference]: Without dead ends: 47 [2018-07-23 13:50:35,421 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 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-07-23 13:50:35,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-23 13:50:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-23 13:50:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-23 13:50:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-23 13:50:35,424 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 43 [2018-07-23 13:50:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:35,425 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-23 13:50:35,425 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 13:50:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-23 13:50:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 13:50:35,425 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:35,426 INFO L357 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-07-23 13:50:35,426 INFO L414 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:35,426 INFO L82 PathProgramCache]: Analyzing trace with hash -952214250, now seen corresponding path program 41 times [2018-07-23 13:50:35,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:35,679 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:35,679 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:35,679 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 13:50:35,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:35,680 INFO L185 omatonBuilderFactory]: Interpolants [5713#true, 5714#false, 5715#(<= x 0), 5716#(<= x 1), 5717#(<= x 2), 5718#(<= x 3), 5719#(<= x 4), 5720#(<= x 5), 5721#(<= x 6), 5722#(<= x 7), 5723#(<= x 8), 5724#(<= x 9), 5725#(<= x 10), 5726#(<= x 11), 5727#(<= x 12), 5728#(<= x 13), 5729#(<= x 14), 5730#(<= x 15), 5731#(<= x 16), 5732#(<= x 17), 5733#(<= x 18), 5734#(<= x 19), 5735#(<= x 20), 5736#(<= x 21), 5737#(<= x 22), 5738#(<= x 23), 5739#(<= x 24), 5740#(<= x 25), 5741#(<= x 26), 5742#(<= x 27), 5743#(<= x 28), 5744#(<= x 29), 5745#(<= x 30), 5746#(<= x 31), 5747#(<= x 32), 5748#(<= x 33), 5749#(<= x 34), 5750#(<= x 35), 5751#(<= x 36), 5752#(<= x 37), 5753#(<= x 38), 5754#(<= x 39), 5755#(<= x 40), 5756#(<= x 41)] [2018-07-23 13:50:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:35,681 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 13:50:35,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 13:50:35,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:50:35,683 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 44 states. [2018-07-23 13:50:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:35,713 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-23 13:50:35,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 13:50:35,714 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-07-23 13:50:35,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:35,714 INFO L225 Difference]: With dead ends: 52 [2018-07-23 13:50:35,714 INFO L226 Difference]: Without dead ends: 48 [2018-07-23 13:50:35,716 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 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-07-23 13:50:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-23 13:50:35,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-23 13:50:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-23 13:50:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-23 13:50:35,720 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2018-07-23 13:50:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:35,720 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-23 13:50:35,720 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 13:50:35,720 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-23 13:50:35,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 13:50:35,721 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:35,721 INFO L357 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-07-23 13:50:35,721 INFO L414 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:35,722 INFO L82 PathProgramCache]: Analyzing trace with hash 546136992, now seen corresponding path program 42 times [2018-07-23 13:50:35,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,017 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:36,017 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 13:50:36,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,018 INFO L185 omatonBuilderFactory]: Interpolants [5957#true, 5958#false, 5959#(<= x 0), 5960#(<= x 1), 5961#(<= x 2), 5962#(<= x 3), 5963#(<= x 4), 5964#(<= x 5), 5965#(<= x 6), 5966#(<= x 7), 5967#(<= x 8), 5968#(<= x 9), 5969#(<= x 10), 5970#(<= x 11), 5971#(<= x 12), 5972#(<= x 13), 5973#(<= x 14), 5974#(<= x 15), 5975#(<= x 16), 5976#(<= x 17), 5977#(<= x 18), 5978#(<= x 19), 5979#(<= x 20), 5980#(<= x 21), 5981#(<= x 22), 5982#(<= x 23), 5983#(<= x 24), 5984#(<= x 25), 5985#(<= x 26), 5986#(<= x 27), 5987#(<= x 28), 5988#(<= x 29), 5989#(<= x 30), 5990#(<= x 31), 5991#(<= x 32), 5992#(<= x 33), 5993#(<= x 34), 5994#(<= x 35), 5995#(<= x 36), 5996#(<= x 37), 5997#(<= x 38), 5998#(<= x 39), 5999#(<= x 40), 6000#(<= x 41), 6001#(<= x 42)] [2018-07-23 13:50:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,018 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 13:50:36,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 13:50:36,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:50:36,020 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 45 states. [2018-07-23 13:50:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:36,050 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-23 13:50:36,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 13:50:36,050 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-07-23 13:50:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:36,051 INFO L225 Difference]: With dead ends: 53 [2018-07-23 13:50:36,051 INFO L226 Difference]: Without dead ends: 49 [2018-07-23 13:50:36,052 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:50:36,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-23 13:50:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-23 13:50:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 13:50:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-23 13:50:36,055 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2018-07-23 13:50:36,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:36,055 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-23 13:50:36,055 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 13:50:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-23 13:50:36,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 13:50:36,056 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:36,056 INFO L357 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-07-23 13:50:36,056 INFO L414 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:36,057 INFO L82 PathProgramCache]: Analyzing trace with hash -249614762, now seen corresponding path program 43 times [2018-07-23 13:50:36,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,278 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:36,278 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 13:50:36,278 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,279 INFO L185 omatonBuilderFactory]: Interpolants [6208#(<= x 0), 6209#(<= x 1), 6210#(<= x 2), 6211#(<= x 3), 6212#(<= x 4), 6213#(<= x 5), 6214#(<= x 6), 6215#(<= x 7), 6216#(<= x 8), 6217#(<= x 9), 6218#(<= x 10), 6219#(<= x 11), 6220#(<= x 12), 6221#(<= x 13), 6222#(<= x 14), 6223#(<= x 15), 6224#(<= x 16), 6225#(<= x 17), 6226#(<= x 18), 6227#(<= x 19), 6228#(<= x 20), 6229#(<= x 21), 6230#(<= x 22), 6231#(<= x 23), 6232#(<= x 24), 6233#(<= x 25), 6234#(<= x 26), 6235#(<= x 27), 6236#(<= x 28), 6237#(<= x 29), 6238#(<= x 30), 6239#(<= x 31), 6240#(<= x 32), 6241#(<= x 33), 6242#(<= x 34), 6243#(<= x 35), 6244#(<= x 36), 6245#(<= x 37), 6246#(<= x 38), 6247#(<= x 39), 6248#(<= x 40), 6249#(<= x 41), 6250#(<= x 42), 6251#(<= x 43), 6206#true, 6207#false] [2018-07-23 13:50:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,280 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 13:50:36,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 13:50:36,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:50:36,283 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 46 states. [2018-07-23 13:50:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:36,318 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-23 13:50:36,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 13:50:36,318 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-07-23 13:50:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:36,319 INFO L225 Difference]: With dead ends: 54 [2018-07-23 13:50:36,319 INFO L226 Difference]: Without dead ends: 50 [2018-07-23 13:50:36,320 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 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-07-23 13:50:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-23 13:50:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-23 13:50:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-23 13:50:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-23 13:50:36,324 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2018-07-23 13:50:36,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:36,325 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-23 13:50:36,325 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 13:50:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-23 13:50:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-23 13:50:36,325 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:36,325 INFO L357 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-07-23 13:50:36,326 INFO L414 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:36,326 INFO L82 PathProgramCache]: Analyzing trace with hash 851884640, now seen corresponding path program 44 times [2018-07-23 13:50:36,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,561 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:36,565 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 13:50:36,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,566 INFO L185 omatonBuilderFactory]: Interpolants [6464#(<= x 2), 6465#(<= x 3), 6466#(<= x 4), 6467#(<= x 5), 6468#(<= x 6), 6469#(<= x 7), 6470#(<= x 8), 6471#(<= x 9), 6472#(<= x 10), 6473#(<= x 11), 6474#(<= x 12), 6475#(<= x 13), 6476#(<= x 14), 6477#(<= x 15), 6478#(<= x 16), 6479#(<= x 17), 6480#(<= x 18), 6481#(<= x 19), 6482#(<= x 20), 6483#(<= x 21), 6484#(<= x 22), 6485#(<= x 23), 6486#(<= x 24), 6487#(<= x 25), 6488#(<= x 26), 6489#(<= x 27), 6490#(<= x 28), 6491#(<= x 29), 6492#(<= x 30), 6493#(<= x 31), 6494#(<= x 32), 6495#(<= x 33), 6496#(<= x 34), 6497#(<= x 35), 6498#(<= x 36), 6499#(<= x 37), 6500#(<= x 38), 6501#(<= x 39), 6502#(<= x 40), 6503#(<= x 41), 6504#(<= x 42), 6505#(<= x 43), 6506#(<= x 44), 6460#true, 6461#false, 6462#(<= x 0), 6463#(<= x 1)] [2018-07-23 13:50:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,566 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 13:50:36,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 13:50:36,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:50:36,568 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 47 states. [2018-07-23 13:50:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:36,601 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-23 13:50:36,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 13:50:36,601 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-07-23 13:50:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:36,602 INFO L225 Difference]: With dead ends: 55 [2018-07-23 13:50:36,602 INFO L226 Difference]: Without dead ends: 51 [2018-07-23 13:50:36,603 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 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-07-23 13:50:36,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-23 13:50:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-23 13:50:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-23 13:50:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-23 13:50:36,606 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2018-07-23 13:50:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:36,607 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-23 13:50:36,607 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 13:50:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-23 13:50:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 13:50:36,607 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:36,607 INFO L357 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-07-23 13:50:36,608 INFO L414 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:36,608 INFO L82 PathProgramCache]: Analyzing trace with hash 638627734, now seen corresponding path program 45 times [2018-07-23 13:50:36,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,862 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:36,862 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 13:50:36,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:36,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,863 INFO L185 omatonBuilderFactory]: Interpolants [6720#false, 6721#(<= x 0), 6722#(<= x 1), 6723#(<= x 2), 6724#(<= x 3), 6725#(<= x 4), 6726#(<= x 5), 6727#(<= x 6), 6728#(<= x 7), 6729#(<= x 8), 6730#(<= x 9), 6731#(<= x 10), 6732#(<= x 11), 6733#(<= x 12), 6734#(<= x 13), 6735#(<= x 14), 6736#(<= x 15), 6737#(<= x 16), 6738#(<= x 17), 6739#(<= x 18), 6740#(<= x 19), 6741#(<= x 20), 6742#(<= x 21), 6743#(<= x 22), 6744#(<= x 23), 6745#(<= x 24), 6746#(<= x 25), 6747#(<= x 26), 6748#(<= x 27), 6749#(<= x 28), 6750#(<= x 29), 6751#(<= x 30), 6752#(<= x 31), 6753#(<= x 32), 6754#(<= x 33), 6755#(<= x 34), 6756#(<= x 35), 6757#(<= x 36), 6758#(<= x 37), 6759#(<= x 38), 6760#(<= x 39), 6761#(<= x 40), 6762#(<= x 41), 6763#(<= x 42), 6764#(<= x 43), 6765#(<= x 44), 6766#(<= x 45), 6719#true] [2018-07-23 13:50:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:36,864 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 13:50:36,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 13:50:36,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:50:36,865 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 48 states. [2018-07-23 13:50:36,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:36,903 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-23 13:50:36,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 13:50:36,903 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-07-23 13:50:36,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:36,904 INFO L225 Difference]: With dead ends: 56 [2018-07-23 13:50:36,904 INFO L226 Difference]: Without dead ends: 52 [2018-07-23 13:50:36,905 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:50:36,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-23 13:50:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-23 13:50:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-23 13:50:36,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-23 13:50:36,908 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2018-07-23 13:50:36,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:36,908 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-23 13:50:36,908 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 13:50:36,908 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-23 13:50:36,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-23 13:50:36,909 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:36,909 INFO L357 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-07-23 13:50:36,909 INFO L414 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:36,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1677369056, now seen corresponding path program 46 times [2018-07-23 13:50:36,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:37,170 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:37,170 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 13:50:37,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:37,171 INFO L185 omatonBuilderFactory]: Interpolants [6983#true, 6984#false, 6985#(<= x 0), 6986#(<= x 1), 6987#(<= x 2), 6988#(<= x 3), 6989#(<= x 4), 6990#(<= x 5), 6991#(<= x 6), 6992#(<= x 7), 6993#(<= x 8), 6994#(<= x 9), 6995#(<= x 10), 6996#(<= x 11), 6997#(<= x 12), 6998#(<= x 13), 6999#(<= x 14), 7000#(<= x 15), 7001#(<= x 16), 7002#(<= x 17), 7003#(<= x 18), 7004#(<= x 19), 7005#(<= x 20), 7006#(<= x 21), 7007#(<= x 22), 7008#(<= x 23), 7009#(<= x 24), 7010#(<= x 25), 7011#(<= x 26), 7012#(<= x 27), 7013#(<= x 28), 7014#(<= x 29), 7015#(<= x 30), 7016#(<= x 31), 7017#(<= x 32), 7018#(<= x 33), 7019#(<= x 34), 7020#(<= x 35), 7021#(<= x 36), 7022#(<= x 37), 7023#(<= x 38), 7024#(<= x 39), 7025#(<= x 40), 7026#(<= x 41), 7027#(<= x 42), 7028#(<= x 43), 7029#(<= x 44), 7030#(<= x 45), 7031#(<= x 46)] [2018-07-23 13:50:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:37,172 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 13:50:37,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 13:50:37,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:50:37,173 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 49 states. [2018-07-23 13:50:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:37,209 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-23 13:50:37,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 13:50:37,209 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-07-23 13:50:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:37,210 INFO L225 Difference]: With dead ends: 57 [2018-07-23 13:50:37,210 INFO L226 Difference]: Without dead ends: 53 [2018-07-23 13:50:37,211 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 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-07-23 13:50:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-23 13:50:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-23 13:50:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 13:50:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-23 13:50:37,215 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2018-07-23 13:50:37,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:37,215 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-23 13:50:37,215 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 13:50:37,216 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-23 13:50:37,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-23 13:50:37,216 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:37,216 INFO L357 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-07-23 13:50:37,216 INFO L414 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:37,217 INFO L82 PathProgramCache]: Analyzing trace with hash -458825514, now seen corresponding path program 47 times [2018-07-23 13:50:37,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:37,494 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:37,494 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 13:50:37,494 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:37,495 INFO L185 omatonBuilderFactory]: Interpolants [7296#(<= x 42), 7297#(<= x 43), 7298#(<= x 44), 7299#(<= x 45), 7300#(<= x 46), 7301#(<= x 47), 7252#true, 7253#false, 7254#(<= x 0), 7255#(<= x 1), 7256#(<= x 2), 7257#(<= x 3), 7258#(<= x 4), 7259#(<= x 5), 7260#(<= x 6), 7261#(<= x 7), 7262#(<= x 8), 7263#(<= x 9), 7264#(<= x 10), 7265#(<= x 11), 7266#(<= x 12), 7267#(<= x 13), 7268#(<= x 14), 7269#(<= x 15), 7270#(<= x 16), 7271#(<= x 17), 7272#(<= x 18), 7273#(<= x 19), 7274#(<= x 20), 7275#(<= x 21), 7276#(<= x 22), 7277#(<= x 23), 7278#(<= x 24), 7279#(<= x 25), 7280#(<= x 26), 7281#(<= x 27), 7282#(<= x 28), 7283#(<= x 29), 7284#(<= x 30), 7285#(<= x 31), 7286#(<= x 32), 7287#(<= x 33), 7288#(<= x 34), 7289#(<= x 35), 7290#(<= x 36), 7291#(<= x 37), 7292#(<= x 38), 7293#(<= x 39), 7294#(<= x 40), 7295#(<= x 41)] [2018-07-23 13:50:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:37,496 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 13:50:37,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 13:50:37,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:50:37,497 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 50 states. [2018-07-23 13:50:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:37,528 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-23 13:50:37,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 13:50:37,528 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-07-23 13:50:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:37,529 INFO L225 Difference]: With dead ends: 58 [2018-07-23 13:50:37,529 INFO L226 Difference]: Without dead ends: 54 [2018-07-23 13:50:37,530 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 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-07-23 13:50:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-23 13:50:37,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-23 13:50:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-23 13:50:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-23 13:50:37,536 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2018-07-23 13:50:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:37,536 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-23 13:50:37,536 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 13:50:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-23 13:50:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-23 13:50:37,537 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:37,537 INFO L357 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-07-23 13:50:37,537 INFO L414 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:37,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1338681376, now seen corresponding path program 48 times [2018-07-23 13:50:37,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:37,825 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:37,825 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 13:50:37,825 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:37,826 INFO L185 omatonBuilderFactory]: Interpolants [7552#(<= x 24), 7553#(<= x 25), 7554#(<= x 26), 7555#(<= x 27), 7556#(<= x 28), 7557#(<= x 29), 7558#(<= x 30), 7559#(<= x 31), 7560#(<= x 32), 7561#(<= x 33), 7562#(<= x 34), 7563#(<= x 35), 7564#(<= x 36), 7565#(<= x 37), 7566#(<= x 38), 7567#(<= x 39), 7568#(<= x 40), 7569#(<= x 41), 7570#(<= x 42), 7571#(<= x 43), 7572#(<= x 44), 7573#(<= x 45), 7574#(<= x 46), 7575#(<= x 47), 7576#(<= x 48), 7526#true, 7527#false, 7528#(<= x 0), 7529#(<= x 1), 7530#(<= x 2), 7531#(<= x 3), 7532#(<= x 4), 7533#(<= x 5), 7534#(<= x 6), 7535#(<= x 7), 7536#(<= x 8), 7537#(<= x 9), 7538#(<= x 10), 7539#(<= x 11), 7540#(<= x 12), 7541#(<= x 13), 7542#(<= x 14), 7543#(<= x 15), 7544#(<= x 16), 7545#(<= x 17), 7546#(<= x 18), 7547#(<= x 19), 7548#(<= x 20), 7549#(<= x 21), 7550#(<= x 22), 7551#(<= x 23)] [2018-07-23 13:50:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:37,826 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 13:50:37,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 13:50:37,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:50:37,828 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 51 states. [2018-07-23 13:50:37,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:37,855 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-23 13:50:37,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 13:50:37,855 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-07-23 13:50:37,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:37,856 INFO L225 Difference]: With dead ends: 59 [2018-07-23 13:50:37,856 INFO L226 Difference]: Without dead ends: 55 [2018-07-23 13:50:37,858 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 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-07-23 13:50:37,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-23 13:50:37,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-23 13:50:37,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-23 13:50:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-23 13:50:37,861 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2018-07-23 13:50:37,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:37,861 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-23 13:50:37,861 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 13:50:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-23 13:50:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 13:50:37,862 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:37,862 INFO L357 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-07-23 13:50:37,862 INFO L414 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:37,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1450557974, now seen corresponding path program 49 times [2018-07-23 13:50:37,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:38,194 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:38,194 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 13:50:38,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:38,195 INFO L185 omatonBuilderFactory]: Interpolants [7808#(<= x 1), 7809#(<= x 2), 7810#(<= x 3), 7811#(<= x 4), 7812#(<= x 5), 7813#(<= x 6), 7814#(<= x 7), 7815#(<= x 8), 7816#(<= x 9), 7817#(<= x 10), 7818#(<= x 11), 7819#(<= x 12), 7820#(<= x 13), 7821#(<= x 14), 7822#(<= x 15), 7823#(<= x 16), 7824#(<= x 17), 7825#(<= x 18), 7826#(<= x 19), 7827#(<= x 20), 7828#(<= x 21), 7829#(<= x 22), 7830#(<= x 23), 7831#(<= x 24), 7832#(<= x 25), 7833#(<= x 26), 7834#(<= x 27), 7835#(<= x 28), 7836#(<= x 29), 7837#(<= x 30), 7838#(<= x 31), 7839#(<= x 32), 7840#(<= x 33), 7841#(<= x 34), 7842#(<= x 35), 7843#(<= x 36), 7844#(<= x 37), 7845#(<= x 38), 7846#(<= x 39), 7847#(<= x 40), 7848#(<= x 41), 7849#(<= x 42), 7850#(<= x 43), 7851#(<= x 44), 7852#(<= x 45), 7853#(<= x 46), 7854#(<= x 47), 7855#(<= x 48), 7856#(<= x 49), 7805#true, 7806#false, 7807#(<= x 0)] [2018-07-23 13:50:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:38,195 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 13:50:38,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 13:50:38,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:50:38,197 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 52 states. [2018-07-23 13:50:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:38,235 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-23 13:50:38,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 13:50:38,235 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-07-23 13:50:38,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:38,236 INFO L225 Difference]: With dead ends: 60 [2018-07-23 13:50:38,236 INFO L226 Difference]: Without dead ends: 56 [2018-07-23 13:50:38,237 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 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-07-23 13:50:38,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-23 13:50:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-23 13:50:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-23 13:50:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-23 13:50:38,240 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2018-07-23 13:50:38,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:38,240 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-23 13:50:38,241 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 13:50:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-23 13:50:38,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-23 13:50:38,241 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:38,241 INFO L357 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-07-23 13:50:38,242 INFO L414 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:38,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2017631904, now seen corresponding path program 50 times [2018-07-23 13:50:38,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:38,588 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:38,588 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 13:50:38,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:38,589 INFO L185 omatonBuilderFactory]: Interpolants [8089#true, 8090#false, 8091#(<= x 0), 8092#(<= x 1), 8093#(<= x 2), 8094#(<= x 3), 8095#(<= x 4), 8096#(<= x 5), 8097#(<= x 6), 8098#(<= x 7), 8099#(<= x 8), 8100#(<= x 9), 8101#(<= x 10), 8102#(<= x 11), 8103#(<= x 12), 8104#(<= x 13), 8105#(<= x 14), 8106#(<= x 15), 8107#(<= x 16), 8108#(<= x 17), 8109#(<= x 18), 8110#(<= x 19), 8111#(<= x 20), 8112#(<= x 21), 8113#(<= x 22), 8114#(<= x 23), 8115#(<= x 24), 8116#(<= x 25), 8117#(<= x 26), 8118#(<= x 27), 8119#(<= x 28), 8120#(<= x 29), 8121#(<= x 30), 8122#(<= x 31), 8123#(<= x 32), 8124#(<= x 33), 8125#(<= x 34), 8126#(<= x 35), 8127#(<= x 36), 8128#(<= x 37), 8129#(<= x 38), 8130#(<= x 39), 8131#(<= x 40), 8132#(<= x 41), 8133#(<= x 42), 8134#(<= x 43), 8135#(<= x 44), 8136#(<= x 45), 8137#(<= x 46), 8138#(<= x 47), 8139#(<= x 48), 8140#(<= x 49), 8141#(<= x 50)] [2018-07-23 13:50:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:38,590 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 13:50:38,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 13:50:38,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:50:38,596 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 53 states. [2018-07-23 13:50:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:38,634 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-23 13:50:38,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 13:50:38,635 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-07-23 13:50:38,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:38,635 INFO L225 Difference]: With dead ends: 61 [2018-07-23 13:50:38,635 INFO L226 Difference]: Without dead ends: 57 [2018-07-23 13:50:38,636 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:50:38,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-23 13:50:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-23 13:50:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 13:50:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-23 13:50:38,645 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2018-07-23 13:50:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:38,645 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-23 13:50:38,645 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 13:50:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-23 13:50:38,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-23 13:50:38,646 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:38,646 INFO L357 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-07-23 13:50:38,646 INFO L414 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:38,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1877912746, now seen corresponding path program 51 times [2018-07-23 13:50:38,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:39,018 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:39,019 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 13:50:39,019 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:39,020 INFO L185 omatonBuilderFactory]: Interpolants [8378#true, 8379#false, 8380#(<= x 0), 8381#(<= x 1), 8382#(<= x 2), 8383#(<= x 3), 8384#(<= x 4), 8385#(<= x 5), 8386#(<= x 6), 8387#(<= x 7), 8388#(<= x 8), 8389#(<= x 9), 8390#(<= x 10), 8391#(<= x 11), 8392#(<= x 12), 8393#(<= x 13), 8394#(<= x 14), 8395#(<= x 15), 8396#(<= x 16), 8397#(<= x 17), 8398#(<= x 18), 8399#(<= x 19), 8400#(<= x 20), 8401#(<= x 21), 8402#(<= x 22), 8403#(<= x 23), 8404#(<= x 24), 8405#(<= x 25), 8406#(<= x 26), 8407#(<= x 27), 8408#(<= x 28), 8409#(<= x 29), 8410#(<= x 30), 8411#(<= x 31), 8412#(<= x 32), 8413#(<= x 33), 8414#(<= x 34), 8415#(<= x 35), 8416#(<= x 36), 8417#(<= x 37), 8418#(<= x 38), 8419#(<= x 39), 8420#(<= x 40), 8421#(<= x 41), 8422#(<= x 42), 8423#(<= x 43), 8424#(<= x 44), 8425#(<= x 45), 8426#(<= x 46), 8427#(<= x 47), 8428#(<= x 48), 8429#(<= x 49), 8430#(<= x 50), 8431#(<= x 51)] [2018-07-23 13:50:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:39,021 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 13:50:39,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 13:50:39,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:50:39,023 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 54 states. [2018-07-23 13:50:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:39,070 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-23 13:50:39,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 13:50:39,070 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-07-23 13:50:39,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:39,071 INFO L225 Difference]: With dead ends: 62 [2018-07-23 13:50:39,071 INFO L226 Difference]: Without dead ends: 58 [2018-07-23 13:50:39,073 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 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-07-23 13:50:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-23 13:50:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-23 13:50:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-23 13:50:39,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-23 13:50:39,076 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2018-07-23 13:50:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:39,077 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-23 13:50:39,077 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 13:50:39,077 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-23 13:50:39,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-23 13:50:39,078 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:39,078 INFO L357 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-07-23 13:50:39,078 INFO L414 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:39,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1914254688, now seen corresponding path program 52 times [2018-07-23 13:50:39,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:39,702 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:39,702 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 13:50:39,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:39,703 INFO L185 omatonBuilderFactory]: Interpolants [8704#(and (<= x 30) (<= 30 x)), 8705#(and (<= 31 x) (<= x 31)), 8706#(and (<= x 32) (<= 32 x)), 8707#(and (<= x 33) (<= 33 x)), 8708#(and (<= x 34) (<= 34 x)), 8709#(and (<= 35 x) (<= x 35)), 8710#(and (<= 36 x) (<= x 36)), 8711#(and (<= 37 x) (<= x 37)), 8712#(and (<= 38 x) (<= x 38)), 8713#(and (<= x 39) (<= 39 x)), 8714#(and (<= 40 x) (<= x 40)), 8715#(and (<= 41 x) (<= x 41)), 8716#(and (<= 42 x) (<= x 42)), 8717#(and (<= x 43) (<= 43 x)), 8718#(and (<= x 44) (<= 44 x)), 8719#(and (<= 45 x) (<= x 45)), 8720#(and (<= 46 x) (<= x 46)), 8721#(and (<= x 47) (<= 47 x)), 8722#(and (<= x 48) (<= 48 x)), 8723#(and (<= 49 x) (<= x 49)), 8724#(and (<= 50 x) (<= x 50)), 8725#(<= x 51), 8726#(<= x 52), 8672#true, 8673#false, 8674#(and (<= 0 x) (<= x 0)), 8675#(and (<= x 1) (<= 1 x)), 8676#(and (<= 2 x) (<= x 2)), 8677#(and (<= 3 x) (<= x 3)), 8678#(and (<= x 4) (<= 4 x)), 8679#(and (<= x 5) (<= 5 x)), 8680#(and (<= 6 x) (<= x 6)), 8681#(and (<= 7 x) (<= x 7)), 8682#(and (<= x 8) (<= 8 x)), 8683#(and (<= 9 x) (<= x 9)), 8684#(and (<= 10 x) (<= x 10)), 8685#(and (<= x 11) (<= 11 x)), 8686#(and (<= 12 x) (<= x 12)), 8687#(and (<= 13 x) (<= x 13)), 8688#(and (<= 14 x) (<= x 14)), 8689#(and (<= x 15) (<= 15 x)), 8690#(and (<= x 16) (<= 16 x)), 8691#(and (<= x 17) (<= 17 x)), 8692#(and (<= 18 x) (<= x 18)), 8693#(and (<= x 19) (<= 19 x)), 8694#(and (<= 20 x) (<= x 20)), 8695#(and (<= x 21) (<= 21 x)), 8696#(and (<= x 22) (<= 22 x)), 8697#(and (<= 23 x) (<= x 23)), 8698#(and (<= 24 x) (<= x 24)), 8699#(and (<= x 25) (<= 25 x)), 8700#(and (<= x 26) (<= 26 x)), 8701#(and (<= 27 x) (<= x 27)), 8702#(and (<= x 28) (<= 28 x)), 8703#(and (<= x 29) (<= 29 x))] [2018-07-23 13:50:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:39,704 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 13:50:39,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 13:50:39,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2760, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:50:39,707 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 55 states. [2018-07-23 13:50:40,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:40,223 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-23 13:50:40,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 13:50:40,223 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-07-23 13:50:40,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:40,224 INFO L225 Difference]: With dead ends: 63 [2018-07-23 13:50:40,224 INFO L226 Difference]: Without dead ends: 59 [2018-07-23 13:50:40,225 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=2760, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:50:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-23 13:50:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-23 13:50:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-23 13:50:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-23 13:50:40,233 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2018-07-23 13:50:40,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:40,233 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-23 13:50:40,233 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 13:50:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-23 13:50:40,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-23 13:50:40,236 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:40,236 INFO L357 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-07-23 13:50:40,236 INFO L414 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:40,236 INFO L82 PathProgramCache]: Analyzing trace with hash -787639146, now seen corresponding path program 53 times [2018-07-23 13:50:40,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:40,678 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:40,678 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 13:50:40,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:40,679 INFO L185 omatonBuilderFactory]: Interpolants [8971#true, 8972#false, 8973#(and (<= 0 x) (<= x 0)), 8974#(and (<= x 1) (<= 1 x)), 8975#(and (<= 2 x) (<= x 2)), 8976#(and (<= 3 x) (<= x 3)), 8977#(and (<= x 4) (<= 4 x)), 8978#(and (<= x 5) (<= 5 x)), 8979#(and (<= 6 x) (<= x 6)), 8980#(and (<= 7 x) (<= x 7)), 8981#(and (<= x 8) (<= 8 x)), 8982#(and (<= 9 x) (<= x 9)), 8983#(and (<= 10 x) (<= x 10)), 8984#(and (<= x 11) (<= 11 x)), 8985#(and (<= 12 x) (<= x 12)), 8986#(and (<= 13 x) (<= x 13)), 8987#(and (<= 14 x) (<= x 14)), 8988#(and (<= x 15) (<= 15 x)), 8989#(and (<= x 16) (<= 16 x)), 8990#(and (<= x 17) (<= 17 x)), 8991#(and (<= 18 x) (<= x 18)), 8992#(and (<= x 19) (<= 19 x)), 8993#(and (<= 20 x) (<= x 20)), 8994#(and (<= x 21) (<= 21 x)), 8995#(and (<= x 22) (<= 22 x)), 8996#(and (<= 23 x) (<= x 23)), 8997#(and (<= 24 x) (<= x 24)), 8998#(and (<= x 25) (<= 25 x)), 8999#(and (<= x 26) (<= 26 x)), 9000#(and (<= 27 x) (<= x 27)), 9001#(and (<= x 28) (<= 28 x)), 9002#(and (<= x 29) (<= 29 x)), 9003#(and (<= x 30) (<= 30 x)), 9004#(and (<= 31 x) (<= x 31)), 9005#(and (<= x 32) (<= 32 x)), 9006#(and (<= x 33) (<= 33 x)), 9007#(and (<= x 34) (<= 34 x)), 9008#(and (<= 35 x) (<= x 35)), 9009#(and (<= 36 x) (<= x 36)), 9010#(and (<= 37 x) (<= x 37)), 9011#(and (<= 38 x) (<= x 38)), 9012#(and (<= x 39) (<= 39 x)), 9013#(and (<= 40 x) (<= x 40)), 9014#(and (<= 41 x) (<= x 41)), 9015#(and (<= 42 x) (<= x 42)), 9016#(and (<= x 43) (<= 43 x)), 9017#(and (<= x 44) (<= 44 x)), 9018#(and (<= 45 x) (<= x 45)), 9019#(and (<= 46 x) (<= x 46)), 9020#(and (<= x 47) (<= 47 x)), 9021#(and (<= x 48) (<= 48 x)), 9022#(and (<= 49 x) (<= x 49)), 9023#(and (<= 50 x) (<= x 50)), 9024#(and (<= x 51) (<= 51 x)), 9025#(<= x 52), 9026#(<= x 53)] [2018-07-23 13:50:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:40,680 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 13:50:40,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 13:50:40,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2866, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:50:40,681 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 56 states. [2018-07-23 13:50:41,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:41,218 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-23 13:50:41,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 13:50:41,218 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-07-23 13:50:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:41,219 INFO L225 Difference]: With dead ends: 64 [2018-07-23 13:50:41,219 INFO L226 Difference]: Without dead ends: 60 [2018-07-23 13:50:41,221 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=2866, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:50:41,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-23 13:50:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-23 13:50:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-23 13:50:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-23 13:50:41,225 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2018-07-23 13:50:41,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:41,226 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-23 13:50:41,226 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 13:50:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-23 13:50:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-23 13:50:41,226 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:41,227 INFO L357 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-07-23 13:50:41,227 INFO L414 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:41,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1352997920, now seen corresponding path program 54 times [2018-07-23 13:50:41,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:41,665 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:41,666 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 13:50:41,666 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:41,667 INFO L185 omatonBuilderFactory]: Interpolants [9275#true, 9276#false, 9277#(and (<= 0 x) (<= x 0)), 9278#(and (<= x 1) (<= 1 x)), 9279#(and (<= 2 x) (<= x 2)), 9280#(and (<= 3 x) (<= x 3)), 9281#(and (<= x 4) (<= 4 x)), 9282#(and (<= x 5) (<= 5 x)), 9283#(and (<= 6 x) (<= x 6)), 9284#(and (<= 7 x) (<= x 7)), 9285#(and (<= x 8) (<= 8 x)), 9286#(and (<= 9 x) (<= x 9)), 9287#(and (<= 10 x) (<= x 10)), 9288#(and (<= x 11) (<= 11 x)), 9289#(and (<= 12 x) (<= x 12)), 9290#(and (<= 13 x) (<= x 13)), 9291#(and (<= 14 x) (<= x 14)), 9292#(and (<= x 15) (<= 15 x)), 9293#(and (<= x 16) (<= 16 x)), 9294#(and (<= x 17) (<= 17 x)), 9295#(and (<= 18 x) (<= x 18)), 9296#(and (<= x 19) (<= 19 x)), 9297#(and (<= 20 x) (<= x 20)), 9298#(and (<= x 21) (<= 21 x)), 9299#(and (<= x 22) (<= 22 x)), 9300#(and (<= 23 x) (<= x 23)), 9301#(and (<= 24 x) (<= x 24)), 9302#(and (<= x 25) (<= 25 x)), 9303#(and (<= x 26) (<= 26 x)), 9304#(and (<= 27 x) (<= x 27)), 9305#(and (<= x 28) (<= 28 x)), 9306#(and (<= x 29) (<= 29 x)), 9307#(and (<= x 30) (<= 30 x)), 9308#(and (<= 31 x) (<= x 31)), 9309#(and (<= x 32) (<= 32 x)), 9310#(and (<= x 33) (<= 33 x)), 9311#(and (<= x 34) (<= 34 x)), 9312#(and (<= 35 x) (<= x 35)), 9313#(and (<= 36 x) (<= x 36)), 9314#(and (<= 37 x) (<= x 37)), 9315#(and (<= 38 x) (<= x 38)), 9316#(and (<= x 39) (<= 39 x)), 9317#(and (<= 40 x) (<= x 40)), 9318#(and (<= 41 x) (<= x 41)), 9319#(and (<= 42 x) (<= x 42)), 9320#(and (<= x 43) (<= 43 x)), 9321#(and (<= x 44) (<= 44 x)), 9322#(and (<= 45 x) (<= x 45)), 9323#(and (<= 46 x) (<= x 46)), 9324#(and (<= x 47) (<= 47 x)), 9325#(and (<= x 48) (<= 48 x)), 9326#(and (<= 49 x) (<= x 49)), 9327#(and (<= 50 x) (<= x 50)), 9328#(and (<= x 51) (<= 51 x)), 9329#(and (<= 52 x) (<= x 52)), 9330#(<= x 53), 9331#(<= x 54)] [2018-07-23 13:50:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:41,667 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 13:50:41,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 13:50:41,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2974, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:50:41,669 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 57 states. [2018-07-23 13:50:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:42,194 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-23 13:50:42,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 13:50:42,195 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-07-23 13:50:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:42,195 INFO L225 Difference]: With dead ends: 65 [2018-07-23 13:50:42,195 INFO L226 Difference]: Without dead ends: 61 [2018-07-23 13:50:42,197 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=2974, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:50:42,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-23 13:50:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-23 13:50:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-23 13:50:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-23 13:50:42,202 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2018-07-23 13:50:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:42,202 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-23 13:50:42,202 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 13:50:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-23 13:50:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-23 13:50:42,203 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:42,203 INFO L357 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-07-23 13:50:42,203 INFO L414 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1006729770, now seen corresponding path program 55 times [2018-07-23 13:50:42,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:42,661 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:42,661 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 13:50:42,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:42,662 INFO L185 omatonBuilderFactory]: Interpolants [9600#(and (<= 14 x) (<= x 14)), 9601#(and (<= x 15) (<= 15 x)), 9602#(and (<= x 16) (<= 16 x)), 9603#(and (<= x 17) (<= 17 x)), 9604#(and (<= 18 x) (<= x 18)), 9605#(and (<= x 19) (<= 19 x)), 9606#(and (<= 20 x) (<= x 20)), 9607#(and (<= x 21) (<= 21 x)), 9608#(and (<= x 22) (<= 22 x)), 9609#(and (<= 23 x) (<= x 23)), 9610#(and (<= 24 x) (<= x 24)), 9611#(and (<= x 25) (<= 25 x)), 9612#(and (<= x 26) (<= 26 x)), 9613#(and (<= 27 x) (<= x 27)), 9614#(and (<= x 28) (<= 28 x)), 9615#(and (<= x 29) (<= 29 x)), 9616#(and (<= x 30) (<= 30 x)), 9617#(and (<= 31 x) (<= x 31)), 9618#(and (<= x 32) (<= 32 x)), 9619#(and (<= x 33) (<= 33 x)), 9620#(and (<= x 34) (<= 34 x)), 9621#(and (<= 35 x) (<= x 35)), 9622#(and (<= 36 x) (<= x 36)), 9623#(and (<= 37 x) (<= x 37)), 9624#(and (<= 38 x) (<= x 38)), 9625#(and (<= x 39) (<= 39 x)), 9626#(and (<= 40 x) (<= x 40)), 9627#(and (<= 41 x) (<= x 41)), 9628#(and (<= 42 x) (<= x 42)), 9629#(and (<= x 43) (<= 43 x)), 9630#(and (<= x 44) (<= 44 x)), 9631#(and (<= 45 x) (<= x 45)), 9632#(and (<= 46 x) (<= x 46)), 9633#(and (<= x 47) (<= 47 x)), 9634#(and (<= x 48) (<= 48 x)), 9635#(and (<= 49 x) (<= x 49)), 9636#(and (<= 50 x) (<= x 50)), 9637#(and (<= x 51) (<= 51 x)), 9638#(and (<= 52 x) (<= x 52)), 9639#(and (<= x 53) (<= 53 x)), 9640#(<= x 54), 9641#(<= x 55), 9584#true, 9585#false, 9586#(and (<= 0 x) (<= x 0)), 9587#(and (<= x 1) (<= 1 x)), 9588#(and (<= 2 x) (<= x 2)), 9589#(and (<= 3 x) (<= x 3)), 9590#(and (<= x 4) (<= 4 x)), 9591#(and (<= x 5) (<= 5 x)), 9592#(and (<= 6 x) (<= x 6)), 9593#(and (<= 7 x) (<= x 7)), 9594#(and (<= x 8) (<= 8 x)), 9595#(and (<= 9 x) (<= x 9)), 9596#(and (<= 10 x) (<= x 10)), 9597#(and (<= x 11) (<= 11 x)), 9598#(and (<= 12 x) (<= x 12)), 9599#(and (<= 13 x) (<= x 13))] [2018-07-23 13:50:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:42,664 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 13:50:42,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 13:50:42,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3084, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:50:42,666 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 58 states. [2018-07-23 13:50:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:43,202 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-23 13:50:43,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 13:50:43,202 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-07-23 13:50:43,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:43,203 INFO L225 Difference]: With dead ends: 66 [2018-07-23 13:50:43,203 INFO L226 Difference]: Without dead ends: 62 [2018-07-23 13:50:43,205 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=3084, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:50:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-23 13:50:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-23 13:50:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-23 13:50:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-23 13:50:43,212 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2018-07-23 13:50:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:43,212 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-23 13:50:43,212 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 13:50:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-23 13:50:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-23 13:50:43,213 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:43,213 INFO L357 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-07-23 13:50:43,213 INFO L414 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:43,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1143844128, now seen corresponding path program 56 times [2018-07-23 13:50:43,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:43,775 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:43,776 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 13:50:43,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:43,778 INFO L185 omatonBuilderFactory]: Interpolants [9898#true, 9899#false, 9900#(and (<= 0 x) (<= x 0)), 9901#(and (<= x 1) (<= 1 x)), 9902#(and (<= 2 x) (<= x 2)), 9903#(and (<= 3 x) (<= x 3)), 9904#(and (<= x 4) (<= 4 x)), 9905#(and (<= x 5) (<= 5 x)), 9906#(and (<= 6 x) (<= x 6)), 9907#(and (<= 7 x) (<= x 7)), 9908#(and (<= x 8) (<= 8 x)), 9909#(and (<= 9 x) (<= x 9)), 9910#(and (<= 10 x) (<= x 10)), 9911#(and (<= x 11) (<= 11 x)), 9912#(and (<= 12 x) (<= x 12)), 9913#(and (<= 13 x) (<= x 13)), 9914#(and (<= 14 x) (<= x 14)), 9915#(and (<= x 15) (<= 15 x)), 9916#(and (<= x 16) (<= 16 x)), 9917#(and (<= x 17) (<= 17 x)), 9918#(and (<= 18 x) (<= x 18)), 9919#(and (<= x 19) (<= 19 x)), 9920#(and (<= 20 x) (<= x 20)), 9921#(and (<= x 21) (<= 21 x)), 9922#(and (<= x 22) (<= 22 x)), 9923#(and (<= 23 x) (<= x 23)), 9924#(and (<= 24 x) (<= x 24)), 9925#(and (<= x 25) (<= 25 x)), 9926#(and (<= x 26) (<= 26 x)), 9927#(and (<= 27 x) (<= x 27)), 9928#(and (<= x 28) (<= 28 x)), 9929#(and (<= x 29) (<= 29 x)), 9930#(and (<= x 30) (<= 30 x)), 9931#(and (<= 31 x) (<= x 31)), 9932#(and (<= x 32) (<= 32 x)), 9933#(and (<= x 33) (<= 33 x)), 9934#(and (<= x 34) (<= 34 x)), 9935#(and (<= 35 x) (<= x 35)), 9936#(and (<= 36 x) (<= x 36)), 9937#(and (<= 37 x) (<= x 37)), 9938#(and (<= 38 x) (<= x 38)), 9939#(and (<= x 39) (<= 39 x)), 9940#(and (<= 40 x) (<= x 40)), 9941#(and (<= 41 x) (<= x 41)), 9942#(and (<= 42 x) (<= x 42)), 9943#(and (<= x 43) (<= 43 x)), 9944#(and (<= x 44) (<= 44 x)), 9945#(and (<= 45 x) (<= x 45)), 9946#(and (<= 46 x) (<= x 46)), 9947#(and (<= x 47) (<= 47 x)), 9948#(and (<= x 48) (<= 48 x)), 9949#(and (<= 49 x) (<= x 49)), 9950#(and (<= 50 x) (<= x 50)), 9951#(and (<= x 51) (<= 51 x)), 9952#(and (<= 52 x) (<= x 52)), 9953#(and (<= x 53) (<= 53 x)), 9954#(and (<= 54 x) (<= x 54)), 9955#(<= x 55), 9956#(<= x 56)] [2018-07-23 13:50:43,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:43,779 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 13:50:43,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 13:50:43,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3196, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:50:43,780 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 59 states. [2018-07-23 13:50:44,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:44,269 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-23 13:50:44,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 13:50:44,269 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-07-23 13:50:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:44,270 INFO L225 Difference]: With dead ends: 67 [2018-07-23 13:50:44,270 INFO L226 Difference]: Without dead ends: 63 [2018-07-23 13:50:44,271 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=3196, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:50:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-23 13:50:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-23 13:50:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-23 13:50:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-23 13:50:44,276 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2018-07-23 13:50:44,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:44,276 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-23 13:50:44,276 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 13:50:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-23 13:50:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-23 13:50:44,277 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:44,277 INFO L357 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-07-23 13:50:44,277 INFO L414 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:44,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1099421930, now seen corresponding path program 57 times [2018-07-23 13:50:44,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:44,680 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:44,680 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 13:50:44,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:44,681 INFO L185 omatonBuilderFactory]: Interpolants [10240#(and (<= x 21) (<= 21 x)), 10241#(and (<= x 22) (<= 22 x)), 10242#(and (<= 23 x) (<= x 23)), 10243#(and (<= 24 x) (<= x 24)), 10244#(and (<= x 25) (<= 25 x)), 10245#(and (<= x 26) (<= 26 x)), 10246#(and (<= 27 x) (<= x 27)), 10247#(and (<= x 28) (<= 28 x)), 10248#(and (<= x 29) (<= 29 x)), 10249#(and (<= x 30) (<= 30 x)), 10250#(and (<= 31 x) (<= x 31)), 10251#(and (<= x 32) (<= 32 x)), 10252#(and (<= x 33) (<= 33 x)), 10253#(and (<= x 34) (<= 34 x)), 10254#(and (<= 35 x) (<= x 35)), 10255#(and (<= 36 x) (<= x 36)), 10256#(and (<= 37 x) (<= x 37)), 10257#(and (<= 38 x) (<= x 38)), 10258#(and (<= x 39) (<= 39 x)), 10259#(and (<= 40 x) (<= x 40)), 10260#(and (<= 41 x) (<= x 41)), 10261#(and (<= 42 x) (<= x 42)), 10262#(and (<= x 43) (<= 43 x)), 10263#(and (<= x 44) (<= 44 x)), 10264#(and (<= 45 x) (<= x 45)), 10265#(and (<= 46 x) (<= x 46)), 10266#(and (<= x 47) (<= 47 x)), 10267#(and (<= x 48) (<= 48 x)), 10268#(and (<= 49 x) (<= x 49)), 10269#(and (<= 50 x) (<= x 50)), 10270#(and (<= x 51) (<= 51 x)), 10271#(and (<= 52 x) (<= x 52)), 10272#(and (<= x 53) (<= 53 x)), 10273#(and (<= 54 x) (<= x 54)), 10274#(and (<= x 55) (<= 55 x)), 10275#(<= x 56), 10276#(<= x 57), 10217#true, 10218#false, 10219#(and (<= 0 x) (<= x 0)), 10220#(and (<= x 1) (<= 1 x)), 10221#(and (<= 2 x) (<= x 2)), 10222#(and (<= 3 x) (<= x 3)), 10223#(and (<= x 4) (<= 4 x)), 10224#(and (<= x 5) (<= 5 x)), 10225#(and (<= 6 x) (<= x 6)), 10226#(and (<= 7 x) (<= x 7)), 10227#(and (<= x 8) (<= 8 x)), 10228#(and (<= 9 x) (<= x 9)), 10229#(and (<= 10 x) (<= x 10)), 10230#(and (<= x 11) (<= 11 x)), 10231#(and (<= 12 x) (<= x 12)), 10232#(and (<= 13 x) (<= x 13)), 10233#(and (<= 14 x) (<= x 14)), 10234#(and (<= x 15) (<= 15 x)), 10235#(and (<= x 16) (<= 16 x)), 10236#(and (<= x 17) (<= 17 x)), 10237#(and (<= 18 x) (<= x 18)), 10238#(and (<= x 19) (<= 19 x)), 10239#(and (<= 20 x) (<= x 20))] [2018-07-23 13:50:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:44,681 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 13:50:44,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 13:50:44,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3310, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:50:44,683 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 60 states. [2018-07-23 13:50:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:45,190 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-23 13:50:45,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 13:50:45,190 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-07-23 13:50:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:45,191 INFO L225 Difference]: With dead ends: 68 [2018-07-23 13:50:45,191 INFO L226 Difference]: Without dead ends: 64 [2018-07-23 13:50:45,192 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=3310, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:50:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-23 13:50:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-23 13:50:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-23 13:50:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-23 13:50:45,197 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2018-07-23 13:50:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:45,197 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-23 13:50:45,197 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 13:50:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-23 13:50:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-23 13:50:45,198 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:45,198 INFO L357 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-07-23 13:50:45,198 INFO L414 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:45,199 INFO L82 PathProgramCache]: Analyzing trace with hash 277666208, now seen corresponding path program 58 times [2018-07-23 13:50:45,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:45,626 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:45,626 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 13:50:45,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:45,627 INFO L185 omatonBuilderFactory]: Interpolants [10541#true, 10542#false, 10543#(and (<= 0 x) (<= x 0)), 10544#(and (<= x 1) (<= 1 x)), 10545#(and (<= 2 x) (<= x 2)), 10546#(and (<= 3 x) (<= x 3)), 10547#(and (<= x 4) (<= 4 x)), 10548#(and (<= x 5) (<= 5 x)), 10549#(and (<= 6 x) (<= x 6)), 10550#(and (<= 7 x) (<= x 7)), 10551#(and (<= x 8) (<= 8 x)), 10552#(and (<= 9 x) (<= x 9)), 10553#(and (<= 10 x) (<= x 10)), 10554#(and (<= x 11) (<= 11 x)), 10555#(and (<= 12 x) (<= x 12)), 10556#(and (<= 13 x) (<= x 13)), 10557#(and (<= 14 x) (<= x 14)), 10558#(and (<= x 15) (<= 15 x)), 10559#(and (<= x 16) (<= 16 x)), 10560#(and (<= x 17) (<= 17 x)), 10561#(and (<= 18 x) (<= x 18)), 10562#(and (<= x 19) (<= 19 x)), 10563#(and (<= 20 x) (<= x 20)), 10564#(and (<= x 21) (<= 21 x)), 10565#(and (<= x 22) (<= 22 x)), 10566#(and (<= 23 x) (<= x 23)), 10567#(and (<= 24 x) (<= x 24)), 10568#(and (<= x 25) (<= 25 x)), 10569#(and (<= x 26) (<= 26 x)), 10570#(and (<= 27 x) (<= x 27)), 10571#(and (<= x 28) (<= 28 x)), 10572#(and (<= x 29) (<= 29 x)), 10573#(and (<= x 30) (<= 30 x)), 10574#(and (<= 31 x) (<= x 31)), 10575#(and (<= x 32) (<= 32 x)), 10576#(and (<= x 33) (<= 33 x)), 10577#(and (<= x 34) (<= 34 x)), 10578#(and (<= 35 x) (<= x 35)), 10579#(and (<= 36 x) (<= x 36)), 10580#(and (<= 37 x) (<= x 37)), 10581#(and (<= 38 x) (<= x 38)), 10582#(and (<= x 39) (<= 39 x)), 10583#(and (<= 40 x) (<= x 40)), 10584#(and (<= 41 x) (<= x 41)), 10585#(and (<= 42 x) (<= x 42)), 10586#(and (<= x 43) (<= 43 x)), 10587#(and (<= x 44) (<= 44 x)), 10588#(and (<= 45 x) (<= x 45)), 10589#(and (<= 46 x) (<= x 46)), 10590#(and (<= x 47) (<= 47 x)), 10591#(and (<= x 48) (<= 48 x)), 10592#(and (<= 49 x) (<= x 49)), 10593#(and (<= 50 x) (<= x 50)), 10594#(and (<= x 51) (<= 51 x)), 10595#(and (<= 52 x) (<= x 52)), 10596#(and (<= x 53) (<= 53 x)), 10597#(and (<= 54 x) (<= x 54)), 10598#(and (<= x 55) (<= 55 x)), 10599#(and (<= 56 x) (<= x 56)), 10600#(<= x 57), 10601#(<= x 58)] [2018-07-23 13:50:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:45,628 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 13:50:45,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 13:50:45,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3426, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:50:45,629 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 61 states. [2018-07-23 13:50:46,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:46,115 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-23 13:50:46,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 13:50:46,115 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-07-23 13:50:46,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:46,116 INFO L225 Difference]: With dead ends: 69 [2018-07-23 13:50:46,116 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 13:50:46,117 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=3426, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:50:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 13:50:46,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-23 13:50:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 13:50:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-23 13:50:46,125 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2018-07-23 13:50:46,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:46,126 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-23 13:50:46,126 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 13:50:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-23 13:50:46,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-23 13:50:46,126 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:46,127 INFO L357 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-07-23 13:50:46,127 INFO L414 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:46,127 INFO L82 PathProgramCache]: Analyzing trace with hash 17725526, now seen corresponding path program 59 times [2018-07-23 13:50:46,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:46,516 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:46,516 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 13:50:46,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:46,517 INFO L185 omatonBuilderFactory]: Interpolants [10880#(and (<= x 8) (<= 8 x)), 10881#(and (<= 9 x) (<= x 9)), 10882#(and (<= 10 x) (<= x 10)), 10883#(and (<= x 11) (<= 11 x)), 10884#(and (<= 12 x) (<= x 12)), 10885#(and (<= 13 x) (<= x 13)), 10886#(and (<= 14 x) (<= x 14)), 10887#(and (<= x 15) (<= 15 x)), 10888#(and (<= x 16) (<= 16 x)), 10889#(and (<= x 17) (<= 17 x)), 10890#(and (<= 18 x) (<= x 18)), 10891#(and (<= x 19) (<= 19 x)), 10892#(and (<= 20 x) (<= x 20)), 10893#(and (<= x 21) (<= 21 x)), 10894#(and (<= x 22) (<= 22 x)), 10895#(and (<= 23 x) (<= x 23)), 10896#(and (<= 24 x) (<= x 24)), 10897#(and (<= x 25) (<= 25 x)), 10898#(and (<= x 26) (<= 26 x)), 10899#(and (<= 27 x) (<= x 27)), 10900#(and (<= x 28) (<= 28 x)), 10901#(and (<= x 29) (<= 29 x)), 10902#(and (<= x 30) (<= 30 x)), 10903#(and (<= 31 x) (<= x 31)), 10904#(and (<= x 32) (<= 32 x)), 10905#(and (<= x 33) (<= 33 x)), 10906#(and (<= x 34) (<= 34 x)), 10907#(and (<= 35 x) (<= x 35)), 10908#(and (<= 36 x) (<= x 36)), 10909#(and (<= 37 x) (<= x 37)), 10910#(and (<= 38 x) (<= x 38)), 10911#(and (<= x 39) (<= 39 x)), 10912#(and (<= 40 x) (<= x 40)), 10913#(and (<= 41 x) (<= x 41)), 10914#(and (<= 42 x) (<= x 42)), 10915#(and (<= x 43) (<= 43 x)), 10916#(and (<= x 44) (<= 44 x)), 10917#(and (<= 45 x) (<= x 45)), 10918#(and (<= 46 x) (<= x 46)), 10919#(and (<= x 47) (<= 47 x)), 10920#(and (<= x 48) (<= 48 x)), 10921#(and (<= 49 x) (<= x 49)), 10922#(and (<= 50 x) (<= x 50)), 10923#(and (<= x 51) (<= 51 x)), 10924#(and (<= 52 x) (<= x 52)), 10925#(and (<= x 53) (<= 53 x)), 10926#(and (<= 54 x) (<= x 54)), 10927#(and (<= x 55) (<= 55 x)), 10928#(and (<= 56 x) (<= x 56)), 10929#(and (<= 57 x) (<= x 57)), 10930#(<= x 58), 10931#(<= x 59), 10870#true, 10871#false, 10872#(and (<= 0 x) (<= x 0)), 10873#(and (<= x 1) (<= 1 x)), 10874#(and (<= 2 x) (<= x 2)), 10875#(and (<= 3 x) (<= x 3)), 10876#(and (<= x 4) (<= 4 x)), 10877#(and (<= x 5) (<= 5 x)), 10878#(and (<= 6 x) (<= x 6)), 10879#(and (<= 7 x) (<= x 7))] [2018-07-23 13:50:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:46,518 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 13:50:46,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 13:50:46,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3544, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:50:46,520 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 62 states. [2018-07-23 13:50:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:47,000 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-23 13:50:47,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 13:50:47,000 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-07-23 13:50:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:47,001 INFO L225 Difference]: With dead ends: 70 [2018-07-23 13:50:47,001 INFO L226 Difference]: Without dead ends: 66 [2018-07-23 13:50:47,002 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=3544, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:50:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-23 13:50:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-23 13:50:47,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-23 13:50:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-23 13:50:47,007 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2018-07-23 13:50:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:47,007 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-23 13:50:47,007 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 13:50:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-23 13:50:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-23 13:50:47,008 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:47,008 INFO L357 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-07-23 13:50:47,008 INFO L414 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:47,009 INFO L82 PathProgramCache]: Analyzing trace with hash 549498976, now seen corresponding path program 60 times [2018-07-23 13:50:47,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:47,425 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:47,425 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 13:50:47,425 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:47,426 INFO L185 omatonBuilderFactory]: Interpolants [11264#(and (<= x 58) (<= 58 x)), 11265#(<= x 59), 11266#(<= x 60), 11204#true, 11205#false, 11206#(and (<= 0 x) (<= x 0)), 11207#(and (<= x 1) (<= 1 x)), 11208#(and (<= 2 x) (<= x 2)), 11209#(and (<= 3 x) (<= x 3)), 11210#(and (<= x 4) (<= 4 x)), 11211#(and (<= x 5) (<= 5 x)), 11212#(and (<= 6 x) (<= x 6)), 11213#(and (<= 7 x) (<= x 7)), 11214#(and (<= x 8) (<= 8 x)), 11215#(and (<= 9 x) (<= x 9)), 11216#(and (<= 10 x) (<= x 10)), 11217#(and (<= x 11) (<= 11 x)), 11218#(and (<= 12 x) (<= x 12)), 11219#(and (<= 13 x) (<= x 13)), 11220#(and (<= 14 x) (<= x 14)), 11221#(and (<= x 15) (<= 15 x)), 11222#(and (<= x 16) (<= 16 x)), 11223#(and (<= x 17) (<= 17 x)), 11224#(and (<= 18 x) (<= x 18)), 11225#(and (<= x 19) (<= 19 x)), 11226#(and (<= 20 x) (<= x 20)), 11227#(and (<= x 21) (<= 21 x)), 11228#(and (<= x 22) (<= 22 x)), 11229#(and (<= 23 x) (<= x 23)), 11230#(and (<= 24 x) (<= x 24)), 11231#(and (<= x 25) (<= 25 x)), 11232#(and (<= x 26) (<= 26 x)), 11233#(and (<= 27 x) (<= x 27)), 11234#(and (<= x 28) (<= 28 x)), 11235#(and (<= x 29) (<= 29 x)), 11236#(and (<= x 30) (<= 30 x)), 11237#(and (<= 31 x) (<= x 31)), 11238#(and (<= x 32) (<= 32 x)), 11239#(and (<= x 33) (<= 33 x)), 11240#(and (<= x 34) (<= 34 x)), 11241#(and (<= 35 x) (<= x 35)), 11242#(and (<= 36 x) (<= x 36)), 11243#(and (<= 37 x) (<= x 37)), 11244#(and (<= 38 x) (<= x 38)), 11245#(and (<= x 39) (<= 39 x)), 11246#(and (<= 40 x) (<= x 40)), 11247#(and (<= 41 x) (<= x 41)), 11248#(and (<= 42 x) (<= x 42)), 11249#(and (<= x 43) (<= 43 x)), 11250#(and (<= x 44) (<= 44 x)), 11251#(and (<= 45 x) (<= x 45)), 11252#(and (<= 46 x) (<= x 46)), 11253#(and (<= x 47) (<= 47 x)), 11254#(and (<= x 48) (<= 48 x)), 11255#(and (<= 49 x) (<= x 49)), 11256#(and (<= 50 x) (<= x 50)), 11257#(and (<= x 51) (<= 51 x)), 11258#(and (<= 52 x) (<= x 52)), 11259#(and (<= x 53) (<= 53 x)), 11260#(and (<= 54 x) (<= x 54)), 11261#(and (<= x 55) (<= 55 x)), 11262#(and (<= 56 x) (<= x 56)), 11263#(and (<= 57 x) (<= x 57))] [2018-07-23 13:50:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:47,427 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 13:50:47,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 13:50:47,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3664, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:50:47,428 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 63 states. [2018-07-23 13:50:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:47,910 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-23 13:50:47,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 13:50:47,910 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-07-23 13:50:47,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:47,911 INFO L225 Difference]: With dead ends: 71 [2018-07-23 13:50:47,911 INFO L226 Difference]: Without dead ends: 67 [2018-07-23 13:50:47,912 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=3664, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:50:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-23 13:50:47,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-23 13:50:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-23 13:50:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-23 13:50:47,917 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2018-07-23 13:50:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:47,917 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-23 13:50:47,917 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 13:50:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-23 13:50:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 13:50:47,918 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:47,918 INFO L357 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-07-23 13:50:47,918 INFO L414 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash -145393258, now seen corresponding path program 61 times [2018-07-23 13:50:47,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:48,317 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:48,317 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 13:50:48,317 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:48,318 INFO L185 omatonBuilderFactory]: Interpolants [11543#true, 11544#false, 11545#(and (<= 0 x) (<= x 0)), 11546#(and (<= x 1) (<= 1 x)), 11547#(and (<= 2 x) (<= x 2)), 11548#(and (<= 3 x) (<= x 3)), 11549#(and (<= x 4) (<= 4 x)), 11550#(and (<= x 5) (<= 5 x)), 11551#(and (<= 6 x) (<= x 6)), 11552#(and (<= 7 x) (<= x 7)), 11553#(and (<= x 8) (<= 8 x)), 11554#(and (<= 9 x) (<= x 9)), 11555#(and (<= 10 x) (<= x 10)), 11556#(and (<= x 11) (<= 11 x)), 11557#(and (<= 12 x) (<= x 12)), 11558#(and (<= 13 x) (<= x 13)), 11559#(and (<= 14 x) (<= x 14)), 11560#(and (<= x 15) (<= 15 x)), 11561#(and (<= x 16) (<= 16 x)), 11562#(and (<= x 17) (<= 17 x)), 11563#(and (<= 18 x) (<= x 18)), 11564#(and (<= x 19) (<= 19 x)), 11565#(and (<= 20 x) (<= x 20)), 11566#(and (<= x 21) (<= 21 x)), 11567#(and (<= x 22) (<= 22 x)), 11568#(and (<= 23 x) (<= x 23)), 11569#(and (<= 24 x) (<= x 24)), 11570#(and (<= x 25) (<= 25 x)), 11571#(and (<= x 26) (<= 26 x)), 11572#(and (<= 27 x) (<= x 27)), 11573#(and (<= x 28) (<= 28 x)), 11574#(and (<= x 29) (<= 29 x)), 11575#(and (<= x 30) (<= 30 x)), 11576#(and (<= 31 x) (<= x 31)), 11577#(and (<= x 32) (<= 32 x)), 11578#(and (<= x 33) (<= 33 x)), 11579#(and (<= x 34) (<= 34 x)), 11580#(and (<= 35 x) (<= x 35)), 11581#(and (<= 36 x) (<= x 36)), 11582#(and (<= 37 x) (<= x 37)), 11583#(and (<= 38 x) (<= x 38)), 11584#(and (<= x 39) (<= 39 x)), 11585#(and (<= 40 x) (<= x 40)), 11586#(and (<= 41 x) (<= x 41)), 11587#(and (<= 42 x) (<= x 42)), 11588#(and (<= x 43) (<= 43 x)), 11589#(and (<= x 44) (<= 44 x)), 11590#(and (<= 45 x) (<= x 45)), 11591#(and (<= 46 x) (<= x 46)), 11592#(and (<= x 47) (<= 47 x)), 11593#(and (<= x 48) (<= 48 x)), 11594#(and (<= 49 x) (<= x 49)), 11595#(and (<= 50 x) (<= x 50)), 11596#(and (<= x 51) (<= 51 x)), 11597#(and (<= 52 x) (<= x 52)), 11598#(and (<= x 53) (<= 53 x)), 11599#(and (<= 54 x) (<= x 54)), 11600#(and (<= x 55) (<= 55 x)), 11601#(and (<= 56 x) (<= x 56)), 11602#(and (<= 57 x) (<= x 57)), 11603#(and (<= x 58) (<= 58 x)), 11604#(and (<= x 59) (<= 59 x)), 11605#(<= x 60), 11606#(<= x 61)] [2018-07-23 13:50:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:48,319 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 13:50:48,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 13:50:48,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3786, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:50:48,322 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 64 states. [2018-07-23 13:50:48,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:48,815 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-23 13:50:48,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 13:50:48,815 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-07-23 13:50:48,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:48,816 INFO L225 Difference]: With dead ends: 72 [2018-07-23 13:50:48,816 INFO L226 Difference]: Without dead ends: 68 [2018-07-23 13:50:48,817 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=3786, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:50:48,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-23 13:50:48,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-23 13:50:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-23 13:50:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-23 13:50:48,824 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2018-07-23 13:50:48,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:48,824 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-23 13:50:48,824 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 13:50:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-23 13:50:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-23 13:50:48,825 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:48,825 INFO L357 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-07-23 13:50:48,825 INFO L414 AbstractCegarLoop]: === Iteration 63 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash -212216032, now seen corresponding path program 62 times [2018-07-23 13:50:48,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:49,218 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:49,218 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 13:50:49,218 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:49,219 INFO L185 omatonBuilderFactory]: Interpolants [11904#(and (<= x 15) (<= 15 x)), 11905#(and (<= x 16) (<= 16 x)), 11906#(and (<= x 17) (<= 17 x)), 11907#(and (<= 18 x) (<= x 18)), 11908#(and (<= x 19) (<= 19 x)), 11909#(and (<= 20 x) (<= x 20)), 11910#(and (<= x 21) (<= 21 x)), 11911#(and (<= x 22) (<= 22 x)), 11912#(and (<= 23 x) (<= x 23)), 11913#(and (<= 24 x) (<= x 24)), 11914#(and (<= x 25) (<= 25 x)), 11915#(and (<= x 26) (<= 26 x)), 11916#(and (<= 27 x) (<= x 27)), 11917#(and (<= x 28) (<= 28 x)), 11918#(and (<= x 29) (<= 29 x)), 11919#(and (<= x 30) (<= 30 x)), 11920#(and (<= 31 x) (<= x 31)), 11921#(and (<= x 32) (<= 32 x)), 11922#(and (<= x 33) (<= 33 x)), 11923#(and (<= x 34) (<= 34 x)), 11924#(and (<= 35 x) (<= x 35)), 11925#(and (<= 36 x) (<= x 36)), 11926#(and (<= 37 x) (<= x 37)), 11927#(and (<= 38 x) (<= x 38)), 11928#(and (<= x 39) (<= 39 x)), 11929#(and (<= 40 x) (<= x 40)), 11930#(and (<= 41 x) (<= x 41)), 11931#(and (<= 42 x) (<= x 42)), 11932#(and (<= x 43) (<= 43 x)), 11933#(and (<= x 44) (<= 44 x)), 11934#(and (<= 45 x) (<= x 45)), 11935#(and (<= 46 x) (<= x 46)), 11936#(and (<= x 47) (<= 47 x)), 11937#(and (<= x 48) (<= 48 x)), 11938#(and (<= 49 x) (<= x 49)), 11939#(and (<= 50 x) (<= x 50)), 11940#(and (<= x 51) (<= 51 x)), 11941#(and (<= 52 x) (<= x 52)), 11942#(and (<= x 53) (<= 53 x)), 11943#(and (<= 54 x) (<= x 54)), 11944#(and (<= x 55) (<= 55 x)), 11945#(and (<= 56 x) (<= x 56)), 11946#(and (<= 57 x) (<= x 57)), 11947#(and (<= x 58) (<= 58 x)), 11948#(and (<= x 59) (<= 59 x)), 11949#(and (<= 60 x) (<= x 60)), 11950#(<= x 61), 11951#(<= x 62), 11887#true, 11888#false, 11889#(and (<= 0 x) (<= x 0)), 11890#(and (<= x 1) (<= 1 x)), 11891#(and (<= 2 x) (<= x 2)), 11892#(and (<= 3 x) (<= x 3)), 11893#(and (<= x 4) (<= 4 x)), 11894#(and (<= x 5) (<= 5 x)), 11895#(and (<= 6 x) (<= x 6)), 11896#(and (<= 7 x) (<= x 7)), 11897#(and (<= x 8) (<= 8 x)), 11898#(and (<= 9 x) (<= x 9)), 11899#(and (<= 10 x) (<= x 10)), 11900#(and (<= x 11) (<= 11 x)), 11901#(and (<= 12 x) (<= x 12)), 11902#(and (<= 13 x) (<= x 13)), 11903#(and (<= 14 x) (<= x 14))] [2018-07-23 13:50:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:49,220 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 13:50:49,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 13:50:49,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=3910, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:50:49,221 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 65 states. [2018-07-23 13:50:49,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:49,733 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-23 13:50:49,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 13:50:49,734 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-07-23 13:50:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:49,734 INFO L225 Difference]: With dead ends: 73 [2018-07-23 13:50:49,734 INFO L226 Difference]: Without dead ends: 69 [2018-07-23 13:50:49,735 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=250, Invalid=3910, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:50:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-23 13:50:49,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-23 13:50:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-23 13:50:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-23 13:50:49,740 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2018-07-23 13:50:49,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:49,740 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-23 13:50:49,741 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 13:50:49,741 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-23 13:50:49,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-23 13:50:49,741 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:49,741 INFO L357 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-07-23 13:50:49,742 INFO L414 AbstractCegarLoop]: === Iteration 64 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:49,742 INFO L82 PathProgramCache]: Analyzing trace with hash 2011245270, now seen corresponding path program 63 times [2018-07-23 13:50:49,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:50,117 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:50,117 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 13:50:50,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:50,118 INFO L185 omatonBuilderFactory]: Interpolants [12288#(and (<= 50 x) (<= x 50)), 12289#(and (<= x 51) (<= 51 x)), 12290#(and (<= 52 x) (<= x 52)), 12291#(and (<= x 53) (<= 53 x)), 12292#(and (<= 54 x) (<= x 54)), 12293#(and (<= x 55) (<= 55 x)), 12294#(and (<= 56 x) (<= x 56)), 12295#(and (<= 57 x) (<= x 57)), 12296#(and (<= x 58) (<= 58 x)), 12297#(and (<= x 59) (<= 59 x)), 12298#(and (<= 60 x) (<= x 60)), 12299#(and (<= 61 x) (<= x 61)), 12300#(<= x 62), 12301#(<= x 63), 12236#true, 12237#false, 12238#(and (<= 0 x) (<= x 0)), 12239#(and (<= x 1) (<= 1 x)), 12240#(and (<= 2 x) (<= x 2)), 12241#(and (<= 3 x) (<= x 3)), 12242#(and (<= x 4) (<= 4 x)), 12243#(and (<= x 5) (<= 5 x)), 12244#(and (<= 6 x) (<= x 6)), 12245#(and (<= 7 x) (<= x 7)), 12246#(and (<= x 8) (<= 8 x)), 12247#(and (<= 9 x) (<= x 9)), 12248#(and (<= 10 x) (<= x 10)), 12249#(and (<= x 11) (<= 11 x)), 12250#(and (<= 12 x) (<= x 12)), 12251#(and (<= 13 x) (<= x 13)), 12252#(and (<= 14 x) (<= x 14)), 12253#(and (<= x 15) (<= 15 x)), 12254#(and (<= x 16) (<= 16 x)), 12255#(and (<= x 17) (<= 17 x)), 12256#(and (<= 18 x) (<= x 18)), 12257#(and (<= x 19) (<= 19 x)), 12258#(and (<= 20 x) (<= x 20)), 12259#(and (<= x 21) (<= 21 x)), 12260#(and (<= x 22) (<= 22 x)), 12261#(and (<= 23 x) (<= x 23)), 12262#(and (<= 24 x) (<= x 24)), 12263#(and (<= x 25) (<= 25 x)), 12264#(and (<= x 26) (<= 26 x)), 12265#(and (<= 27 x) (<= x 27)), 12266#(and (<= x 28) (<= 28 x)), 12267#(and (<= x 29) (<= 29 x)), 12268#(and (<= x 30) (<= 30 x)), 12269#(and (<= 31 x) (<= x 31)), 12270#(and (<= x 32) (<= 32 x)), 12271#(and (<= x 33) (<= 33 x)), 12272#(and (<= x 34) (<= 34 x)), 12273#(and (<= 35 x) (<= x 35)), 12274#(and (<= 36 x) (<= x 36)), 12275#(and (<= 37 x) (<= x 37)), 12276#(and (<= 38 x) (<= x 38)), 12277#(and (<= x 39) (<= 39 x)), 12278#(and (<= 40 x) (<= x 40)), 12279#(and (<= 41 x) (<= x 41)), 12280#(and (<= 42 x) (<= x 42)), 12281#(and (<= x 43) (<= 43 x)), 12282#(and (<= x 44) (<= 44 x)), 12283#(and (<= 45 x) (<= x 45)), 12284#(and (<= 46 x) (<= x 46)), 12285#(and (<= x 47) (<= 47 x)), 12286#(and (<= x 48) (<= 48 x)), 12287#(and (<= 49 x) (<= x 49))] [2018-07-23 13:50:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:50,119 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 13:50:50,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 13:50:50,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4036, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:50:50,120 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 66 states. [2018-07-23 13:50:50,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:50,669 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-23 13:50:50,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 13:50:50,669 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-07-23 13:50:50,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:50,672 INFO L225 Difference]: With dead ends: 74 [2018-07-23 13:50:50,672 INFO L226 Difference]: Without dead ends: 70 [2018-07-23 13:50:50,673 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=4036, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:50:50,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-23 13:50:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-23 13:50:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-23 13:50:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-23 13:50:50,685 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2018-07-23 13:50:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:50,685 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-23 13:50:50,686 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 13:50:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-23 13:50:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-23 13:50:50,686 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:50,687 INFO L357 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-07-23 13:50:50,687 INFO L414 AbstractCegarLoop]: === Iteration 65 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:50,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2075898400, now seen corresponding path program 64 times [2018-07-23 13:50:50,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:51,199 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:51,199 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 13:50:51,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:51,200 INFO L185 omatonBuilderFactory]: Interpolants [12590#true, 12591#false, 12592#(and (<= 0 x) (<= x 0)), 12593#(and (<= x 1) (<= 1 x)), 12594#(and (<= 2 x) (<= x 2)), 12595#(and (<= 3 x) (<= x 3)), 12596#(and (<= x 4) (<= 4 x)), 12597#(and (<= x 5) (<= 5 x)), 12598#(and (<= 6 x) (<= x 6)), 12599#(and (<= 7 x) (<= x 7)), 12600#(and (<= x 8) (<= 8 x)), 12601#(and (<= 9 x) (<= x 9)), 12602#(and (<= 10 x) (<= x 10)), 12603#(and (<= x 11) (<= 11 x)), 12604#(and (<= 12 x) (<= x 12)), 12605#(and (<= 13 x) (<= x 13)), 12606#(and (<= 14 x) (<= x 14)), 12607#(and (<= x 15) (<= 15 x)), 12608#(and (<= x 16) (<= 16 x)), 12609#(and (<= x 17) (<= 17 x)), 12610#(and (<= 18 x) (<= x 18)), 12611#(and (<= x 19) (<= 19 x)), 12612#(and (<= 20 x) (<= x 20)), 12613#(and (<= x 21) (<= 21 x)), 12614#(and (<= x 22) (<= 22 x)), 12615#(and (<= 23 x) (<= x 23)), 12616#(and (<= 24 x) (<= x 24)), 12617#(and (<= x 25) (<= 25 x)), 12618#(and (<= x 26) (<= 26 x)), 12619#(and (<= 27 x) (<= x 27)), 12620#(and (<= x 28) (<= 28 x)), 12621#(and (<= x 29) (<= 29 x)), 12622#(and (<= x 30) (<= 30 x)), 12623#(and (<= 31 x) (<= x 31)), 12624#(and (<= x 32) (<= 32 x)), 12625#(and (<= x 33) (<= 33 x)), 12626#(and (<= x 34) (<= 34 x)), 12627#(and (<= 35 x) (<= x 35)), 12628#(and (<= 36 x) (<= x 36)), 12629#(and (<= 37 x) (<= x 37)), 12630#(and (<= 38 x) (<= x 38)), 12631#(and (<= x 39) (<= 39 x)), 12632#(and (<= 40 x) (<= x 40)), 12633#(and (<= 41 x) (<= x 41)), 12634#(and (<= 42 x) (<= x 42)), 12635#(and (<= x 43) (<= 43 x)), 12636#(and (<= x 44) (<= 44 x)), 12637#(and (<= 45 x) (<= x 45)), 12638#(and (<= 46 x) (<= x 46)), 12639#(and (<= x 47) (<= 47 x)), 12640#(and (<= x 48) (<= 48 x)), 12641#(and (<= 49 x) (<= x 49)), 12642#(and (<= 50 x) (<= x 50)), 12643#(and (<= x 51) (<= 51 x)), 12644#(and (<= 52 x) (<= x 52)), 12645#(and (<= x 53) (<= 53 x)), 12646#(and (<= 54 x) (<= x 54)), 12647#(and (<= x 55) (<= 55 x)), 12648#(and (<= 56 x) (<= x 56)), 12649#(and (<= 57 x) (<= x 57)), 12650#(and (<= x 58) (<= 58 x)), 12651#(and (<= x 59) (<= 59 x)), 12652#(and (<= 60 x) (<= x 60)), 12653#(and (<= 61 x) (<= x 61)), 12654#(and (<= 62 x) (<= x 62)), 12655#(<= x 63), 12656#(<= x 64)] [2018-07-23 13:50:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:51,201 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 13:50:51,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 13:50:51,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=4164, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:50:51,202 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 67 states. [2018-07-23 13:50:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:51,674 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-23 13:50:51,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 13:50:51,674 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-07-23 13:50:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:51,675 INFO L225 Difference]: With dead ends: 75 [2018-07-23 13:50:51,675 INFO L226 Difference]: Without dead ends: 71 [2018-07-23 13:50:51,676 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=4164, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:50:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-23 13:50:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-23 13:50:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-23 13:50:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-23 13:50:51,681 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2018-07-23 13:50:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:51,681 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-23 13:50:51,681 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 13:50:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-23 13:50:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 13:50:51,682 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:51,682 INFO L357 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-07-23 13:50:51,682 INFO L414 AbstractCegarLoop]: === Iteration 66 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:51,683 INFO L82 PathProgramCache]: Analyzing trace with hash 71666710, now seen corresponding path program 65 times [2018-07-23 13:50:51,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:52,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:52,045 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:52,045 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 13:50:52,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:52,046 INFO L185 omatonBuilderFactory]: Interpolants [12949#true, 12950#false, 12951#(and (<= 0 x) (<= x 0)), 12952#(and (<= x 1) (<= 1 x)), 12953#(and (<= 2 x) (<= x 2)), 12954#(and (<= 3 x) (<= x 3)), 12955#(and (<= x 4) (<= 4 x)), 12956#(and (<= x 5) (<= 5 x)), 12957#(and (<= 6 x) (<= x 6)), 12958#(and (<= 7 x) (<= x 7)), 12959#(and (<= x 8) (<= 8 x)), 12960#(and (<= 9 x) (<= x 9)), 12961#(and (<= 10 x) (<= x 10)), 12962#(and (<= x 11) (<= 11 x)), 12963#(and (<= 12 x) (<= x 12)), 12964#(and (<= 13 x) (<= x 13)), 12965#(and (<= 14 x) (<= x 14)), 12966#(and (<= x 15) (<= 15 x)), 12967#(and (<= x 16) (<= 16 x)), 12968#(and (<= x 17) (<= 17 x)), 12969#(and (<= 18 x) (<= x 18)), 12970#(and (<= x 19) (<= 19 x)), 12971#(and (<= 20 x) (<= x 20)), 12972#(and (<= x 21) (<= 21 x)), 12973#(and (<= x 22) (<= 22 x)), 12974#(and (<= 23 x) (<= x 23)), 12975#(and (<= 24 x) (<= x 24)), 12976#(and (<= x 25) (<= 25 x)), 12977#(and (<= x 26) (<= 26 x)), 12978#(and (<= 27 x) (<= x 27)), 12979#(and (<= x 28) (<= 28 x)), 12980#(and (<= x 29) (<= 29 x)), 12981#(and (<= x 30) (<= 30 x)), 12982#(and (<= 31 x) (<= x 31)), 12983#(and (<= x 32) (<= 32 x)), 12984#(and (<= x 33) (<= 33 x)), 12985#(and (<= x 34) (<= 34 x)), 12986#(and (<= 35 x) (<= x 35)), 12987#(and (<= 36 x) (<= x 36)), 12988#(and (<= 37 x) (<= x 37)), 12989#(and (<= 38 x) (<= x 38)), 12990#(and (<= x 39) (<= 39 x)), 12991#(and (<= 40 x) (<= x 40)), 12992#(and (<= 41 x) (<= x 41)), 12993#(and (<= 42 x) (<= x 42)), 12994#(and (<= x 43) (<= 43 x)), 12995#(and (<= x 44) (<= 44 x)), 12996#(and (<= 45 x) (<= x 45)), 12997#(and (<= 46 x) (<= x 46)), 12998#(and (<= x 47) (<= 47 x)), 12999#(and (<= x 48) (<= 48 x)), 13000#(and (<= 49 x) (<= x 49)), 13001#(and (<= 50 x) (<= x 50)), 13002#(and (<= x 51) (<= 51 x)), 13003#(and (<= 52 x) (<= x 52)), 13004#(and (<= x 53) (<= 53 x)), 13005#(and (<= 54 x) (<= x 54)), 13006#(and (<= x 55) (<= 55 x)), 13007#(and (<= 56 x) (<= x 56)), 13008#(and (<= 57 x) (<= x 57)), 13009#(and (<= x 58) (<= 58 x)), 13010#(and (<= x 59) (<= 59 x)), 13011#(and (<= 60 x) (<= x 60)), 13012#(and (<= 61 x) (<= x 61)), 13013#(and (<= 62 x) (<= x 62)), 13014#(and (<= 63 x) (<= x 63)), 13015#(<= x 64), 13016#(<= x 65)] [2018-07-23 13:50:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:52,047 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 13:50:52,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 13:50:52,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=4294, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:50:52,050 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 68 states. [2018-07-23 13:50:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:52,521 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-23 13:50:52,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 13:50:52,522 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-07-23 13:50:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:52,522 INFO L225 Difference]: With dead ends: 76 [2018-07-23 13:50:52,522 INFO L226 Difference]: Without dead ends: 72 [2018-07-23 13:50:52,523 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=262, Invalid=4294, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:50:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-23 13:50:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-23 13:50:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-23 13:50:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-23 13:50:52,529 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2018-07-23 13:50:52,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:52,529 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-23 13:50:52,529 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 13:50:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-23 13:50:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-23 13:50:52,530 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:52,530 INFO L357 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-07-23 13:50:52,530 INFO L414 AbstractCegarLoop]: === Iteration 67 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:52,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2073291616, now seen corresponding path program 66 times [2018-07-23 13:50:52,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:52,917 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:52,918 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 13:50:52,918 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:52,919 INFO L185 omatonBuilderFactory]: Interpolants [13313#true, 13314#false, 13315#(and (<= 0 x) (<= x 0)), 13316#(and (<= x 1) (<= 1 x)), 13317#(and (<= 2 x) (<= x 2)), 13318#(and (<= 3 x) (<= x 3)), 13319#(and (<= x 4) (<= 4 x)), 13320#(and (<= x 5) (<= 5 x)), 13321#(and (<= 6 x) (<= x 6)), 13322#(and (<= 7 x) (<= x 7)), 13323#(and (<= x 8) (<= 8 x)), 13324#(and (<= 9 x) (<= x 9)), 13325#(and (<= 10 x) (<= x 10)), 13326#(and (<= x 11) (<= 11 x)), 13327#(and (<= 12 x) (<= x 12)), 13328#(and (<= 13 x) (<= x 13)), 13329#(and (<= 14 x) (<= x 14)), 13330#(and (<= x 15) (<= 15 x)), 13331#(and (<= x 16) (<= 16 x)), 13332#(and (<= x 17) (<= 17 x)), 13333#(and (<= 18 x) (<= x 18)), 13334#(and (<= x 19) (<= 19 x)), 13335#(and (<= 20 x) (<= x 20)), 13336#(and (<= x 21) (<= 21 x)), 13337#(and (<= x 22) (<= 22 x)), 13338#(and (<= 23 x) (<= x 23)), 13339#(and (<= 24 x) (<= x 24)), 13340#(and (<= x 25) (<= 25 x)), 13341#(and (<= x 26) (<= 26 x)), 13342#(and (<= 27 x) (<= x 27)), 13343#(and (<= x 28) (<= 28 x)), 13344#(and (<= x 29) (<= 29 x)), 13345#(and (<= x 30) (<= 30 x)), 13346#(and (<= 31 x) (<= x 31)), 13347#(and (<= x 32) (<= 32 x)), 13348#(and (<= x 33) (<= 33 x)), 13349#(and (<= x 34) (<= 34 x)), 13350#(and (<= 35 x) (<= x 35)), 13351#(and (<= 36 x) (<= x 36)), 13352#(and (<= 37 x) (<= x 37)), 13353#(and (<= 38 x) (<= x 38)), 13354#(and (<= x 39) (<= 39 x)), 13355#(and (<= 40 x) (<= x 40)), 13356#(and (<= 41 x) (<= x 41)), 13357#(and (<= 42 x) (<= x 42)), 13358#(and (<= x 43) (<= 43 x)), 13359#(and (<= x 44) (<= 44 x)), 13360#(and (<= 45 x) (<= x 45)), 13361#(and (<= 46 x) (<= x 46)), 13362#(and (<= x 47) (<= 47 x)), 13363#(and (<= x 48) (<= 48 x)), 13364#(and (<= 49 x) (<= x 49)), 13365#(and (<= 50 x) (<= x 50)), 13366#(and (<= x 51) (<= 51 x)), 13367#(and (<= 52 x) (<= x 52)), 13368#(and (<= x 53) (<= 53 x)), 13369#(and (<= 54 x) (<= x 54)), 13370#(and (<= x 55) (<= 55 x)), 13371#(and (<= 56 x) (<= x 56)), 13372#(and (<= 57 x) (<= x 57)), 13373#(and (<= x 58) (<= 58 x)), 13374#(and (<= x 59) (<= 59 x)), 13375#(and (<= 60 x) (<= x 60)), 13376#(and (<= 61 x) (<= x 61)), 13377#(and (<= 62 x) (<= x 62)), 13378#(and (<= 63 x) (<= x 63)), 13379#(and (<= 64 x) (<= x 64)), 13380#(<= x 65), 13381#(<= x 66)] [2018-07-23 13:50:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:52,919 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 13:50:52,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 13:50:52,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=4426, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:50:52,920 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 69 states. [2018-07-23 13:50:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:53,386 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-23 13:50:53,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 13:50:53,386 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-07-23 13:50:53,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:53,387 INFO L225 Difference]: With dead ends: 77 [2018-07-23 13:50:53,387 INFO L226 Difference]: Without dead ends: 73 [2018-07-23 13:50:53,388 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=266, Invalid=4426, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:50:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-23 13:50:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-23 13:50:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-23 13:50:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-23 13:50:53,394 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2018-07-23 13:50:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:53,394 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-23 13:50:53,395 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 13:50:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-23 13:50:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-23 13:50:53,395 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:53,395 INFO L357 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-07-23 13:50:53,396 INFO L414 AbstractCegarLoop]: === Iteration 68 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:53,396 INFO L82 PathProgramCache]: Analyzing trace with hash 152477014, now seen corresponding path program 67 times [2018-07-23 13:50:53,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:53,809 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:53,809 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 13:50:53,809 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:53,810 INFO L185 omatonBuilderFactory]: Interpolants [13696#(and (<= 12 x) (<= x 12)), 13697#(and (<= 13 x) (<= x 13)), 13698#(and (<= 14 x) (<= x 14)), 13699#(and (<= x 15) (<= 15 x)), 13700#(and (<= x 16) (<= 16 x)), 13701#(and (<= x 17) (<= 17 x)), 13702#(and (<= 18 x) (<= x 18)), 13703#(and (<= x 19) (<= 19 x)), 13704#(and (<= 20 x) (<= x 20)), 13705#(and (<= x 21) (<= 21 x)), 13706#(and (<= x 22) (<= 22 x)), 13707#(and (<= 23 x) (<= x 23)), 13708#(and (<= 24 x) (<= x 24)), 13709#(and (<= x 25) (<= 25 x)), 13710#(and (<= x 26) (<= 26 x)), 13711#(and (<= 27 x) (<= x 27)), 13712#(and (<= x 28) (<= 28 x)), 13713#(and (<= x 29) (<= 29 x)), 13714#(and (<= x 30) (<= 30 x)), 13715#(and (<= 31 x) (<= x 31)), 13716#(and (<= x 32) (<= 32 x)), 13717#(and (<= x 33) (<= 33 x)), 13718#(and (<= x 34) (<= 34 x)), 13719#(and (<= 35 x) (<= x 35)), 13720#(and (<= 36 x) (<= x 36)), 13721#(and (<= 37 x) (<= x 37)), 13722#(and (<= 38 x) (<= x 38)), 13723#(and (<= x 39) (<= 39 x)), 13724#(and (<= 40 x) (<= x 40)), 13725#(and (<= 41 x) (<= x 41)), 13726#(and (<= 42 x) (<= x 42)), 13727#(and (<= x 43) (<= 43 x)), 13728#(and (<= x 44) (<= 44 x)), 13729#(and (<= 45 x) (<= x 45)), 13730#(and (<= 46 x) (<= x 46)), 13731#(and (<= x 47) (<= 47 x)), 13732#(and (<= x 48) (<= 48 x)), 13733#(and (<= 49 x) (<= x 49)), 13734#(and (<= 50 x) (<= x 50)), 13735#(and (<= x 51) (<= 51 x)), 13736#(and (<= 52 x) (<= x 52)), 13737#(and (<= x 53) (<= 53 x)), 13738#(and (<= 54 x) (<= x 54)), 13739#(and (<= x 55) (<= 55 x)), 13740#(and (<= 56 x) (<= x 56)), 13741#(and (<= 57 x) (<= x 57)), 13742#(and (<= x 58) (<= 58 x)), 13743#(and (<= x 59) (<= 59 x)), 13744#(and (<= 60 x) (<= x 60)), 13745#(and (<= 61 x) (<= x 61)), 13746#(and (<= 62 x) (<= x 62)), 13747#(and (<= 63 x) (<= x 63)), 13748#(and (<= 64 x) (<= x 64)), 13749#(and (<= 65 x) (<= x 65)), 13750#(<= x 66), 13751#(<= x 67), 13682#true, 13683#false, 13684#(and (<= 0 x) (<= x 0)), 13685#(and (<= x 1) (<= 1 x)), 13686#(and (<= 2 x) (<= x 2)), 13687#(and (<= 3 x) (<= x 3)), 13688#(and (<= x 4) (<= 4 x)), 13689#(and (<= x 5) (<= 5 x)), 13690#(and (<= 6 x) (<= x 6)), 13691#(and (<= 7 x) (<= x 7)), 13692#(and (<= x 8) (<= 8 x)), 13693#(and (<= 9 x) (<= x 9)), 13694#(and (<= 10 x) (<= x 10)), 13695#(and (<= x 11) (<= 11 x))] [2018-07-23 13:50:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:53,811 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 13:50:53,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 13:50:53,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=4560, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:50:53,812 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 70 states. [2018-07-23 13:50:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:54,233 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-23 13:50:54,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 13:50:54,233 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-07-23 13:50:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:54,234 INFO L225 Difference]: With dead ends: 78 [2018-07-23 13:50:54,234 INFO L226 Difference]: Without dead ends: 74 [2018-07-23 13:50:54,235 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=4560, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:50:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-23 13:50:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-23 13:50:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-23 13:50:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-23 13:50:54,241 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2018-07-23 13:50:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:54,241 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-23 13:50:54,241 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 13:50:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-23 13:50:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-23 13:50:54,242 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:54,242 INFO L357 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-07-23 13:50:54,243 INFO L414 AbstractCegarLoop]: === Iteration 69 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:54,243 INFO L82 PathProgramCache]: Analyzing trace with hash 431827808, now seen corresponding path program 68 times [2018-07-23 13:50:54,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:54,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:54,702 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:54,702 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 13:50:54,702 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:54,703 INFO L185 omatonBuilderFactory]: Interpolants [14080#(and (<= x 22) (<= 22 x)), 14081#(and (<= 23 x) (<= x 23)), 14082#(and (<= 24 x) (<= x 24)), 14083#(and (<= x 25) (<= 25 x)), 14084#(and (<= x 26) (<= 26 x)), 14085#(and (<= 27 x) (<= x 27)), 14086#(and (<= x 28) (<= 28 x)), 14087#(and (<= x 29) (<= 29 x)), 14088#(and (<= x 30) (<= 30 x)), 14089#(and (<= 31 x) (<= x 31)), 14090#(and (<= x 32) (<= 32 x)), 14091#(and (<= x 33) (<= 33 x)), 14092#(and (<= x 34) (<= 34 x)), 14093#(and (<= 35 x) (<= x 35)), 14094#(and (<= 36 x) (<= x 36)), 14095#(and (<= 37 x) (<= x 37)), 14096#(and (<= 38 x) (<= x 38)), 14097#(and (<= x 39) (<= 39 x)), 14098#(and (<= 40 x) (<= x 40)), 14099#(and (<= 41 x) (<= x 41)), 14100#(and (<= 42 x) (<= x 42)), 14101#(and (<= x 43) (<= 43 x)), 14102#(and (<= x 44) (<= 44 x)), 14103#(and (<= 45 x) (<= x 45)), 14104#(and (<= 46 x) (<= x 46)), 14105#(and (<= x 47) (<= 47 x)), 14106#(and (<= x 48) (<= 48 x)), 14107#(and (<= 49 x) (<= x 49)), 14108#(and (<= 50 x) (<= x 50)), 14109#(and (<= x 51) (<= 51 x)), 14110#(and (<= 52 x) (<= x 52)), 14111#(and (<= x 53) (<= 53 x)), 14112#(and (<= 54 x) (<= x 54)), 14113#(and (<= x 55) (<= 55 x)), 14114#(and (<= 56 x) (<= x 56)), 14115#(and (<= 57 x) (<= x 57)), 14116#(and (<= x 58) (<= 58 x)), 14117#(and (<= x 59) (<= 59 x)), 14118#(and (<= 60 x) (<= x 60)), 14119#(and (<= 61 x) (<= x 61)), 14120#(and (<= 62 x) (<= x 62)), 14121#(and (<= 63 x) (<= x 63)), 14122#(and (<= 64 x) (<= x 64)), 14123#(and (<= 65 x) (<= x 65)), 14124#(and (<= x 66) (<= 66 x)), 14125#(<= x 67), 14126#(<= x 68), 14056#true, 14057#false, 14058#(and (<= 0 x) (<= x 0)), 14059#(and (<= x 1) (<= 1 x)), 14060#(and (<= 2 x) (<= x 2)), 14061#(and (<= 3 x) (<= x 3)), 14062#(and (<= x 4) (<= 4 x)), 14063#(and (<= x 5) (<= 5 x)), 14064#(and (<= 6 x) (<= x 6)), 14065#(and (<= 7 x) (<= x 7)), 14066#(and (<= x 8) (<= 8 x)), 14067#(and (<= 9 x) (<= x 9)), 14068#(and (<= 10 x) (<= x 10)), 14069#(and (<= x 11) (<= 11 x)), 14070#(and (<= 12 x) (<= x 12)), 14071#(and (<= 13 x) (<= x 13)), 14072#(and (<= 14 x) (<= x 14)), 14073#(and (<= x 15) (<= 15 x)), 14074#(and (<= x 16) (<= 16 x)), 14075#(and (<= x 17) (<= 17 x)), 14076#(and (<= 18 x) (<= x 18)), 14077#(and (<= x 19) (<= 19 x)), 14078#(and (<= 20 x) (<= x 20)), 14079#(and (<= x 21) (<= 21 x))] [2018-07-23 13:50:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:54,704 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 13:50:54,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 13:50:54,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=4696, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:50:54,705 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 71 states. [2018-07-23 13:50:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:55,230 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-23 13:50:55,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 13:50:55,230 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-07-23 13:50:55,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:55,231 INFO L225 Difference]: With dead ends: 79 [2018-07-23 13:50:55,231 INFO L226 Difference]: Without dead ends: 75 [2018-07-23 13:50:55,232 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=274, Invalid=4696, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:50:55,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-23 13:50:55,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-23 13:50:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-23 13:50:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-23 13:50:55,238 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2018-07-23 13:50:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:55,238 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-23 13:50:55,238 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 13:50:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-23 13:50:55,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-23 13:50:55,239 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:55,239 INFO L357 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-07-23 13:50:55,240 INFO L414 AbstractCegarLoop]: === Iteration 70 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:55,240 INFO L82 PathProgramCache]: Analyzing trace with hash 501767830, now seen corresponding path program 69 times [2018-07-23 13:50:55,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:55,676 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:55,676 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 13:50:55,676 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:55,677 INFO L185 omatonBuilderFactory]: Interpolants [14464#(and (<= 27 x) (<= x 27)), 14465#(and (<= x 28) (<= 28 x)), 14466#(and (<= x 29) (<= 29 x)), 14467#(and (<= x 30) (<= 30 x)), 14468#(and (<= 31 x) (<= x 31)), 14469#(and (<= x 32) (<= 32 x)), 14470#(and (<= x 33) (<= 33 x)), 14471#(and (<= x 34) (<= 34 x)), 14472#(and (<= 35 x) (<= x 35)), 14473#(and (<= 36 x) (<= x 36)), 14474#(and (<= 37 x) (<= x 37)), 14475#(and (<= 38 x) (<= x 38)), 14476#(and (<= x 39) (<= 39 x)), 14477#(and (<= 40 x) (<= x 40)), 14478#(and (<= 41 x) (<= x 41)), 14479#(and (<= 42 x) (<= x 42)), 14480#(and (<= x 43) (<= 43 x)), 14481#(and (<= x 44) (<= 44 x)), 14482#(and (<= 45 x) (<= x 45)), 14483#(and (<= 46 x) (<= x 46)), 14484#(and (<= x 47) (<= 47 x)), 14485#(and (<= x 48) (<= 48 x)), 14486#(and (<= 49 x) (<= x 49)), 14487#(and (<= 50 x) (<= x 50)), 14488#(and (<= x 51) (<= 51 x)), 14489#(and (<= 52 x) (<= x 52)), 14490#(and (<= x 53) (<= 53 x)), 14491#(and (<= 54 x) (<= x 54)), 14492#(and (<= x 55) (<= 55 x)), 14493#(and (<= 56 x) (<= x 56)), 14494#(and (<= 57 x) (<= x 57)), 14495#(and (<= x 58) (<= 58 x)), 14496#(and (<= x 59) (<= 59 x)), 14497#(and (<= 60 x) (<= x 60)), 14498#(and (<= 61 x) (<= x 61)), 14499#(and (<= 62 x) (<= x 62)), 14500#(and (<= 63 x) (<= x 63)), 14501#(and (<= 64 x) (<= x 64)), 14502#(and (<= 65 x) (<= x 65)), 14503#(and (<= x 66) (<= 66 x)), 14504#(and (<= x 67) (<= 67 x)), 14505#(<= x 68), 14506#(<= x 69), 14435#true, 14436#false, 14437#(and (<= 0 x) (<= x 0)), 14438#(and (<= x 1) (<= 1 x)), 14439#(and (<= 2 x) (<= x 2)), 14440#(and (<= 3 x) (<= x 3)), 14441#(and (<= x 4) (<= 4 x)), 14442#(and (<= x 5) (<= 5 x)), 14443#(and (<= 6 x) (<= x 6)), 14444#(and (<= 7 x) (<= x 7)), 14445#(and (<= x 8) (<= 8 x)), 14446#(and (<= 9 x) (<= x 9)), 14447#(and (<= 10 x) (<= x 10)), 14448#(and (<= x 11) (<= 11 x)), 14449#(and (<= 12 x) (<= x 12)), 14450#(and (<= 13 x) (<= x 13)), 14451#(and (<= 14 x) (<= x 14)), 14452#(and (<= x 15) (<= 15 x)), 14453#(and (<= x 16) (<= 16 x)), 14454#(and (<= x 17) (<= 17 x)), 14455#(and (<= 18 x) (<= x 18)), 14456#(and (<= x 19) (<= 19 x)), 14457#(and (<= 20 x) (<= x 20)), 14458#(and (<= x 21) (<= 21 x)), 14459#(and (<= x 22) (<= 22 x)), 14460#(and (<= 23 x) (<= x 23)), 14461#(and (<= 24 x) (<= x 24)), 14462#(and (<= x 25) (<= 25 x)), 14463#(and (<= x 26) (<= 26 x))] [2018-07-23 13:50:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:55,678 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 13:50:55,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 13:50:55,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=4834, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:50:55,679 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 72 states. [2018-07-23 13:50:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:56,167 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-23 13:50:56,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 13:50:56,167 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-07-23 13:50:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:56,168 INFO L225 Difference]: With dead ends: 80 [2018-07-23 13:50:56,168 INFO L226 Difference]: Without dead ends: 76 [2018-07-23 13:50:56,169 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=4834, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:50:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-23 13:50:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-23 13:50:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-23 13:50:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-23 13:50:56,175 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2018-07-23 13:50:56,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:56,175 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-23 13:50:56,175 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 13:50:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-23 13:50:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-23 13:50:56,176 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:56,176 INFO L357 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-07-23 13:50:56,177 INFO L414 AbstractCegarLoop]: === Iteration 71 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:56,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1625058784, now seen corresponding path program 70 times [2018-07-23 13:50:56,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:56,633 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:56,634 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 13:50:56,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:56,635 INFO L185 omatonBuilderFactory]: Interpolants [14848#(and (<= 27 x) (<= x 27)), 14849#(and (<= x 28) (<= 28 x)), 14850#(and (<= x 29) (<= 29 x)), 14851#(and (<= x 30) (<= 30 x)), 14852#(and (<= 31 x) (<= x 31)), 14853#(and (<= x 32) (<= 32 x)), 14854#(and (<= x 33) (<= 33 x)), 14855#(and (<= x 34) (<= 34 x)), 14856#(and (<= 35 x) (<= x 35)), 14857#(and (<= 36 x) (<= x 36)), 14858#(and (<= 37 x) (<= x 37)), 14859#(and (<= 38 x) (<= x 38)), 14860#(and (<= x 39) (<= 39 x)), 14861#(and (<= 40 x) (<= x 40)), 14862#(and (<= 41 x) (<= x 41)), 14863#(and (<= 42 x) (<= x 42)), 14864#(and (<= x 43) (<= 43 x)), 14865#(and (<= x 44) (<= 44 x)), 14866#(and (<= 45 x) (<= x 45)), 14867#(and (<= 46 x) (<= x 46)), 14868#(and (<= x 47) (<= 47 x)), 14869#(and (<= x 48) (<= 48 x)), 14870#(and (<= 49 x) (<= x 49)), 14871#(and (<= 50 x) (<= x 50)), 14872#(and (<= x 51) (<= 51 x)), 14873#(and (<= 52 x) (<= x 52)), 14874#(and (<= x 53) (<= 53 x)), 14875#(and (<= 54 x) (<= x 54)), 14876#(and (<= x 55) (<= 55 x)), 14877#(and (<= 56 x) (<= x 56)), 14878#(and (<= 57 x) (<= x 57)), 14879#(and (<= x 58) (<= 58 x)), 14880#(and (<= x 59) (<= 59 x)), 14881#(and (<= 60 x) (<= x 60)), 14882#(and (<= 61 x) (<= x 61)), 14883#(and (<= 62 x) (<= x 62)), 14884#(and (<= 63 x) (<= x 63)), 14885#(and (<= 64 x) (<= x 64)), 14886#(and (<= 65 x) (<= x 65)), 14887#(and (<= x 66) (<= 66 x)), 14888#(and (<= x 67) (<= 67 x)), 14889#(and (<= 68 x) (<= x 68)), 14890#(<= x 69), 14891#(<= x 70), 14819#true, 14820#false, 14821#(and (<= 0 x) (<= x 0)), 14822#(and (<= x 1) (<= 1 x)), 14823#(and (<= 2 x) (<= x 2)), 14824#(and (<= 3 x) (<= x 3)), 14825#(and (<= x 4) (<= 4 x)), 14826#(and (<= x 5) (<= 5 x)), 14827#(and (<= 6 x) (<= x 6)), 14828#(and (<= 7 x) (<= x 7)), 14829#(and (<= x 8) (<= 8 x)), 14830#(and (<= 9 x) (<= x 9)), 14831#(and (<= 10 x) (<= x 10)), 14832#(and (<= x 11) (<= 11 x)), 14833#(and (<= 12 x) (<= x 12)), 14834#(and (<= 13 x) (<= x 13)), 14835#(and (<= 14 x) (<= x 14)), 14836#(and (<= x 15) (<= 15 x)), 14837#(and (<= x 16) (<= 16 x)), 14838#(and (<= x 17) (<= 17 x)), 14839#(and (<= 18 x) (<= x 18)), 14840#(and (<= x 19) (<= 19 x)), 14841#(and (<= 20 x) (<= x 20)), 14842#(and (<= x 21) (<= 21 x)), 14843#(and (<= x 22) (<= 22 x)), 14844#(and (<= 23 x) (<= x 23)), 14845#(and (<= 24 x) (<= x 24)), 14846#(and (<= x 25) (<= 25 x)), 14847#(and (<= x 26) (<= 26 x))] [2018-07-23 13:50:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:56,635 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 13:50:56,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 13:50:56,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=4974, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:50:56,637 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 73 states. [2018-07-23 13:50:57,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:57,050 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-23 13:50:57,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 13:50:57,050 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-07-23 13:50:57,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:57,051 INFO L225 Difference]: With dead ends: 81 [2018-07-23 13:50:57,051 INFO L226 Difference]: Without dead ends: 77 [2018-07-23 13:50:57,052 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=4974, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:50:57,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-23 13:50:57,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-23 13:50:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-23 13:50:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-23 13:50:57,058 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2018-07-23 13:50:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:57,059 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-23 13:50:57,059 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 13:50:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-23 13:50:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-23 13:50:57,059 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:57,060 INFO L357 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-07-23 13:50:57,060 INFO L414 AbstractCegarLoop]: === Iteration 72 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:57,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1162792918, now seen corresponding path program 71 times [2018-07-23 13:50:57,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:57,495 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:57,495 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 13:50:57,495 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:57,496 INFO L185 omatonBuilderFactory]: Interpolants [15232#(and (<= x 22) (<= 22 x)), 15233#(and (<= 23 x) (<= x 23)), 15234#(and (<= 24 x) (<= x 24)), 15235#(and (<= x 25) (<= 25 x)), 15236#(and (<= x 26) (<= 26 x)), 15237#(and (<= 27 x) (<= x 27)), 15238#(and (<= x 28) (<= 28 x)), 15239#(and (<= x 29) (<= 29 x)), 15240#(and (<= x 30) (<= 30 x)), 15241#(and (<= 31 x) (<= x 31)), 15242#(and (<= x 32) (<= 32 x)), 15243#(and (<= x 33) (<= 33 x)), 15244#(and (<= x 34) (<= 34 x)), 15245#(and (<= 35 x) (<= x 35)), 15246#(and (<= 36 x) (<= x 36)), 15247#(and (<= 37 x) (<= x 37)), 15248#(and (<= 38 x) (<= x 38)), 15249#(and (<= x 39) (<= 39 x)), 15250#(and (<= 40 x) (<= x 40)), 15251#(and (<= 41 x) (<= x 41)), 15252#(and (<= 42 x) (<= x 42)), 15253#(and (<= x 43) (<= 43 x)), 15254#(and (<= x 44) (<= 44 x)), 15255#(and (<= 45 x) (<= x 45)), 15256#(and (<= 46 x) (<= x 46)), 15257#(and (<= x 47) (<= 47 x)), 15258#(and (<= x 48) (<= 48 x)), 15259#(and (<= 49 x) (<= x 49)), 15260#(and (<= 50 x) (<= x 50)), 15261#(and (<= x 51) (<= 51 x)), 15262#(and (<= 52 x) (<= x 52)), 15263#(and (<= x 53) (<= 53 x)), 15264#(and (<= 54 x) (<= x 54)), 15265#(and (<= x 55) (<= 55 x)), 15266#(and (<= 56 x) (<= x 56)), 15267#(and (<= 57 x) (<= x 57)), 15268#(and (<= x 58) (<= 58 x)), 15269#(and (<= x 59) (<= 59 x)), 15270#(and (<= 60 x) (<= x 60)), 15271#(and (<= 61 x) (<= x 61)), 15272#(and (<= 62 x) (<= x 62)), 15273#(and (<= 63 x) (<= x 63)), 15274#(and (<= 64 x) (<= x 64)), 15275#(and (<= 65 x) (<= x 65)), 15276#(and (<= x 66) (<= 66 x)), 15277#(and (<= x 67) (<= 67 x)), 15278#(and (<= 68 x) (<= x 68)), 15279#(and (<= 69 x) (<= x 69)), 15280#(<= x 70), 15281#(<= x 71), 15208#true, 15209#false, 15210#(and (<= 0 x) (<= x 0)), 15211#(and (<= x 1) (<= 1 x)), 15212#(and (<= 2 x) (<= x 2)), 15213#(and (<= 3 x) (<= x 3)), 15214#(and (<= x 4) (<= 4 x)), 15215#(and (<= x 5) (<= 5 x)), 15216#(and (<= 6 x) (<= x 6)), 15217#(and (<= 7 x) (<= x 7)), 15218#(and (<= x 8) (<= 8 x)), 15219#(and (<= 9 x) (<= x 9)), 15220#(and (<= 10 x) (<= x 10)), 15221#(and (<= x 11) (<= 11 x)), 15222#(and (<= 12 x) (<= x 12)), 15223#(and (<= 13 x) (<= x 13)), 15224#(and (<= 14 x) (<= x 14)), 15225#(and (<= x 15) (<= 15 x)), 15226#(and (<= x 16) (<= 16 x)), 15227#(and (<= x 17) (<= 17 x)), 15228#(and (<= 18 x) (<= x 18)), 15229#(and (<= x 19) (<= 19 x)), 15230#(and (<= 20 x) (<= x 20)), 15231#(and (<= x 21) (<= 21 x))] [2018-07-23 13:50:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:57,497 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 13:50:57,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 13:50:57,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=5116, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:50:57,498 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 74 states. [2018-07-23 13:50:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:58,044 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-23 13:50:58,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 13:50:58,044 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-07-23 13:50:58,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:58,045 INFO L225 Difference]: With dead ends: 82 [2018-07-23 13:50:58,045 INFO L226 Difference]: Without dead ends: 78 [2018-07-23 13:50:58,046 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=5116, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:50:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-23 13:50:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-23 13:50:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-23 13:50:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-23 13:50:58,050 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2018-07-23 13:50:58,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:58,051 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-23 13:50:58,051 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 13:50:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-23 13:50:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-23 13:50:58,051 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:58,052 INFO L357 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-07-23 13:50:58,052 INFO L414 AbstractCegarLoop]: === Iteration 73 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:58,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1686849760, now seen corresponding path program 72 times [2018-07-23 13:50:58,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:58,421 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:58,421 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 13:50:58,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:58,422 INFO L185 omatonBuilderFactory]: Interpolants [15616#(and (<= 12 x) (<= x 12)), 15617#(and (<= 13 x) (<= x 13)), 15618#(and (<= 14 x) (<= x 14)), 15619#(and (<= x 15) (<= 15 x)), 15620#(and (<= x 16) (<= 16 x)), 15621#(and (<= x 17) (<= 17 x)), 15622#(and (<= 18 x) (<= x 18)), 15623#(and (<= x 19) (<= 19 x)), 15624#(and (<= 20 x) (<= x 20)), 15625#(and (<= x 21) (<= 21 x)), 15626#(and (<= x 22) (<= 22 x)), 15627#(and (<= 23 x) (<= x 23)), 15628#(and (<= 24 x) (<= x 24)), 15629#(and (<= x 25) (<= 25 x)), 15630#(and (<= x 26) (<= 26 x)), 15631#(and (<= 27 x) (<= x 27)), 15632#(and (<= x 28) (<= 28 x)), 15633#(and (<= x 29) (<= 29 x)), 15634#(and (<= x 30) (<= 30 x)), 15635#(and (<= 31 x) (<= x 31)), 15636#(and (<= x 32) (<= 32 x)), 15637#(and (<= x 33) (<= 33 x)), 15638#(and (<= x 34) (<= 34 x)), 15639#(and (<= 35 x) (<= x 35)), 15640#(and (<= 36 x) (<= x 36)), 15641#(and (<= 37 x) (<= x 37)), 15642#(and (<= 38 x) (<= x 38)), 15643#(and (<= x 39) (<= 39 x)), 15644#(and (<= 40 x) (<= x 40)), 15645#(and (<= 41 x) (<= x 41)), 15646#(and (<= 42 x) (<= x 42)), 15647#(and (<= x 43) (<= 43 x)), 15648#(and (<= x 44) (<= 44 x)), 15649#(and (<= 45 x) (<= x 45)), 15650#(and (<= 46 x) (<= x 46)), 15651#(and (<= x 47) (<= 47 x)), 15652#(and (<= x 48) (<= 48 x)), 15653#(and (<= 49 x) (<= x 49)), 15654#(and (<= 50 x) (<= x 50)), 15655#(and (<= x 51) (<= 51 x)), 15656#(and (<= 52 x) (<= x 52)), 15657#(and (<= x 53) (<= 53 x)), 15658#(and (<= 54 x) (<= x 54)), 15659#(and (<= x 55) (<= 55 x)), 15660#(and (<= 56 x) (<= x 56)), 15661#(and (<= 57 x) (<= x 57)), 15662#(and (<= x 58) (<= 58 x)), 15663#(and (<= x 59) (<= 59 x)), 15664#(and (<= 60 x) (<= x 60)), 15665#(and (<= 61 x) (<= x 61)), 15666#(and (<= 62 x) (<= x 62)), 15667#(and (<= 63 x) (<= x 63)), 15668#(and (<= 64 x) (<= x 64)), 15669#(and (<= 65 x) (<= x 65)), 15670#(and (<= x 66) (<= 66 x)), 15671#(and (<= x 67) (<= 67 x)), 15672#(and (<= 68 x) (<= x 68)), 15673#(and (<= 69 x) (<= x 69)), 15674#(and (<= 70 x) (<= x 70)), 15675#(<= x 71), 15676#(<= x 72), 15602#true, 15603#false, 15604#(and (<= 0 x) (<= x 0)), 15605#(and (<= x 1) (<= 1 x)), 15606#(and (<= 2 x) (<= x 2)), 15607#(and (<= 3 x) (<= x 3)), 15608#(and (<= x 4) (<= 4 x)), 15609#(and (<= x 5) (<= 5 x)), 15610#(and (<= 6 x) (<= x 6)), 15611#(and (<= 7 x) (<= x 7)), 15612#(and (<= x 8) (<= 8 x)), 15613#(and (<= 9 x) (<= x 9)), 15614#(and (<= 10 x) (<= x 10)), 15615#(and (<= x 11) (<= 11 x))] [2018-07-23 13:50:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:58,423 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 13:50:58,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 13:50:58,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=5260, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:50:58,424 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 75 states. [2018-07-23 13:50:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:58,810 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-23 13:50:58,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 13:50:58,811 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-07-23 13:50:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:58,811 INFO L225 Difference]: With dead ends: 83 [2018-07-23 13:50:58,811 INFO L226 Difference]: Without dead ends: 79 [2018-07-23 13:50:58,812 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=290, Invalid=5260, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:50:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-23 13:50:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-23 13:50:58,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-23 13:50:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-23 13:50:58,817 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2018-07-23 13:50:58,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:58,818 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-23 13:50:58,818 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 13:50:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-23 13:50:58,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 13:50:58,818 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:58,818 INFO L357 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-07-23 13:50:58,819 INFO L414 AbstractCegarLoop]: === Iteration 74 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:58,819 INFO L82 PathProgramCache]: Analyzing trace with hash 752742678, now seen corresponding path program 73 times [2018-07-23 13:50:58,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:59,274 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:59,274 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 13:50:59,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:59,275 INFO L185 omatonBuilderFactory]: Interpolants [16001#true, 16002#false, 16003#(and (<= 0 x) (<= x 0)), 16004#(and (<= x 1) (<= 1 x)), 16005#(and (<= 2 x) (<= x 2)), 16006#(and (<= 3 x) (<= x 3)), 16007#(and (<= x 4) (<= 4 x)), 16008#(and (<= x 5) (<= 5 x)), 16009#(and (<= 6 x) (<= x 6)), 16010#(and (<= 7 x) (<= x 7)), 16011#(and (<= x 8) (<= 8 x)), 16012#(and (<= 9 x) (<= x 9)), 16013#(and (<= 10 x) (<= x 10)), 16014#(and (<= x 11) (<= 11 x)), 16015#(and (<= 12 x) (<= x 12)), 16016#(and (<= 13 x) (<= x 13)), 16017#(and (<= 14 x) (<= x 14)), 16018#(and (<= x 15) (<= 15 x)), 16019#(and (<= x 16) (<= 16 x)), 16020#(and (<= x 17) (<= 17 x)), 16021#(and (<= 18 x) (<= x 18)), 16022#(and (<= x 19) (<= 19 x)), 16023#(and (<= 20 x) (<= x 20)), 16024#(and (<= x 21) (<= 21 x)), 16025#(and (<= x 22) (<= 22 x)), 16026#(and (<= 23 x) (<= x 23)), 16027#(and (<= 24 x) (<= x 24)), 16028#(and (<= x 25) (<= 25 x)), 16029#(and (<= x 26) (<= 26 x)), 16030#(and (<= 27 x) (<= x 27)), 16031#(and (<= x 28) (<= 28 x)), 16032#(and (<= x 29) (<= 29 x)), 16033#(and (<= x 30) (<= 30 x)), 16034#(and (<= 31 x) (<= x 31)), 16035#(and (<= x 32) (<= 32 x)), 16036#(and (<= x 33) (<= 33 x)), 16037#(and (<= x 34) (<= 34 x)), 16038#(and (<= 35 x) (<= x 35)), 16039#(and (<= 36 x) (<= x 36)), 16040#(and (<= 37 x) (<= x 37)), 16041#(and (<= 38 x) (<= x 38)), 16042#(and (<= x 39) (<= 39 x)), 16043#(and (<= 40 x) (<= x 40)), 16044#(and (<= 41 x) (<= x 41)), 16045#(and (<= 42 x) (<= x 42)), 16046#(and (<= x 43) (<= 43 x)), 16047#(and (<= x 44) (<= 44 x)), 16048#(and (<= 45 x) (<= x 45)), 16049#(and (<= 46 x) (<= x 46)), 16050#(and (<= x 47) (<= 47 x)), 16051#(and (<= x 48) (<= 48 x)), 16052#(and (<= 49 x) (<= x 49)), 16053#(and (<= 50 x) (<= x 50)), 16054#(and (<= x 51) (<= 51 x)), 16055#(and (<= 52 x) (<= x 52)), 16056#(and (<= x 53) (<= 53 x)), 16057#(and (<= 54 x) (<= x 54)), 16058#(and (<= x 55) (<= 55 x)), 16059#(and (<= 56 x) (<= x 56)), 16060#(and (<= 57 x) (<= x 57)), 16061#(and (<= x 58) (<= 58 x)), 16062#(and (<= x 59) (<= 59 x)), 16063#(and (<= 60 x) (<= x 60)), 16064#(and (<= 61 x) (<= x 61)), 16065#(and (<= 62 x) (<= x 62)), 16066#(and (<= 63 x) (<= x 63)), 16067#(and (<= 64 x) (<= x 64)), 16068#(and (<= 65 x) (<= x 65)), 16069#(and (<= x 66) (<= 66 x)), 16070#(and (<= x 67) (<= 67 x)), 16071#(and (<= 68 x) (<= x 68)), 16072#(and (<= 69 x) (<= x 69)), 16073#(and (<= 70 x) (<= x 70)), 16074#(and (<= x 71) (<= 71 x)), 16075#(<= x 72), 16076#(<= x 73)] [2018-07-23 13:50:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:59,276 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 13:50:59,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 13:50:59,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=5406, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:50:59,277 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 76 states. [2018-07-23 13:50:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:59,754 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-23 13:50:59,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 13:50:59,755 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-07-23 13:50:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:59,755 INFO L225 Difference]: With dead ends: 84 [2018-07-23 13:50:59,755 INFO L226 Difference]: Without dead ends: 80 [2018-07-23 13:50:59,756 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=5406, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:50:59,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-23 13:50:59,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-23 13:50:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-23 13:50:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-23 13:50:59,762 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2018-07-23 13:50:59,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:59,762 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-23 13:50:59,762 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 13:50:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-23 13:50:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-23 13:50:59,763 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:59,763 INFO L357 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-07-23 13:50:59,763 INFO L414 AbstractCegarLoop]: === Iteration 75 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:50:59,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1860194208, now seen corresponding path program 74 times [2018-07-23 13:50:59,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:00,243 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:00,243 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 13:51:00,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:00,244 INFO L185 omatonBuilderFactory]: Interpolants [16405#true, 16406#false, 16407#(and (<= 0 x) (<= x 0)), 16408#(and (<= x 1) (<= 1 x)), 16409#(and (<= 2 x) (<= x 2)), 16410#(and (<= 3 x) (<= x 3)), 16411#(and (<= x 4) (<= 4 x)), 16412#(and (<= x 5) (<= 5 x)), 16413#(and (<= 6 x) (<= x 6)), 16414#(and (<= 7 x) (<= x 7)), 16415#(and (<= x 8) (<= 8 x)), 16416#(and (<= 9 x) (<= x 9)), 16417#(and (<= 10 x) (<= x 10)), 16418#(and (<= x 11) (<= 11 x)), 16419#(and (<= 12 x) (<= x 12)), 16420#(and (<= 13 x) (<= x 13)), 16421#(and (<= 14 x) (<= x 14)), 16422#(and (<= x 15) (<= 15 x)), 16423#(and (<= x 16) (<= 16 x)), 16424#(and (<= x 17) (<= 17 x)), 16425#(and (<= 18 x) (<= x 18)), 16426#(and (<= x 19) (<= 19 x)), 16427#(and (<= 20 x) (<= x 20)), 16428#(and (<= x 21) (<= 21 x)), 16429#(and (<= x 22) (<= 22 x)), 16430#(and (<= 23 x) (<= x 23)), 16431#(and (<= 24 x) (<= x 24)), 16432#(and (<= x 25) (<= 25 x)), 16433#(and (<= x 26) (<= 26 x)), 16434#(and (<= 27 x) (<= x 27)), 16435#(and (<= x 28) (<= 28 x)), 16436#(and (<= x 29) (<= 29 x)), 16437#(and (<= x 30) (<= 30 x)), 16438#(and (<= 31 x) (<= x 31)), 16439#(and (<= x 32) (<= 32 x)), 16440#(and (<= x 33) (<= 33 x)), 16441#(and (<= x 34) (<= 34 x)), 16442#(and (<= 35 x) (<= x 35)), 16443#(and (<= 36 x) (<= x 36)), 16444#(and (<= 37 x) (<= x 37)), 16445#(and (<= 38 x) (<= x 38)), 16446#(and (<= x 39) (<= 39 x)), 16447#(and (<= 40 x) (<= x 40)), 16448#(and (<= 41 x) (<= x 41)), 16449#(and (<= 42 x) (<= x 42)), 16450#(and (<= x 43) (<= 43 x)), 16451#(and (<= x 44) (<= 44 x)), 16452#(and (<= 45 x) (<= x 45)), 16453#(and (<= 46 x) (<= x 46)), 16454#(and (<= x 47) (<= 47 x)), 16455#(and (<= x 48) (<= 48 x)), 16456#(and (<= 49 x) (<= x 49)), 16457#(and (<= 50 x) (<= x 50)), 16458#(and (<= x 51) (<= 51 x)), 16459#(and (<= 52 x) (<= x 52)), 16460#(and (<= x 53) (<= 53 x)), 16461#(and (<= 54 x) (<= x 54)), 16462#(and (<= x 55) (<= 55 x)), 16463#(and (<= 56 x) (<= x 56)), 16464#(and (<= 57 x) (<= x 57)), 16465#(and (<= x 58) (<= 58 x)), 16466#(and (<= x 59) (<= 59 x)), 16467#(and (<= 60 x) (<= x 60)), 16468#(and (<= 61 x) (<= x 61)), 16469#(and (<= 62 x) (<= x 62)), 16470#(and (<= 63 x) (<= x 63)), 16471#(and (<= 64 x) (<= x 64)), 16472#(and (<= 65 x) (<= x 65)), 16473#(and (<= x 66) (<= 66 x)), 16474#(and (<= x 67) (<= 67 x)), 16475#(and (<= 68 x) (<= x 68)), 16476#(and (<= 69 x) (<= x 69)), 16477#(and (<= 70 x) (<= x 70)), 16478#(and (<= x 71) (<= 71 x)), 16479#(and (<= x 72) (<= 72 x)), 16480#(<= x 73), 16481#(<= x 74)] [2018-07-23 13:51:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:00,245 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 13:51:00,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 13:51:00,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=5554, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:51:00,246 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 77 states. [2018-07-23 13:51:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:00,719 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-23 13:51:00,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 13:51:00,719 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-07-23 13:51:00,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:00,720 INFO L225 Difference]: With dead ends: 85 [2018-07-23 13:51:00,720 INFO L226 Difference]: Without dead ends: 81 [2018-07-23 13:51:00,721 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=298, Invalid=5554, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:51:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-23 13:51:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-23 13:51:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-23 13:51:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-23 13:51:00,726 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2018-07-23 13:51:00,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:00,726 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-23 13:51:00,726 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 13:51:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-23 13:51:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-23 13:51:00,727 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:00,727 INFO L357 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-07-23 13:51:00,727 INFO L414 AbstractCegarLoop]: === Iteration 76 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:00,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1831453270, now seen corresponding path program 75 times [2018-07-23 13:51:00,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:01,267 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:01,267 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 13:51:01,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:01,268 INFO L185 omatonBuilderFactory]: Interpolants [16814#true, 16815#false, 16816#(and (<= 0 x) (<= x 0)), 16817#(and (<= x 1) (<= 1 x)), 16818#(and (<= 2 x) (<= x 2)), 16819#(and (<= 3 x) (<= x 3)), 16820#(and (<= x 4) (<= 4 x)), 16821#(and (<= x 5) (<= 5 x)), 16822#(and (<= 6 x) (<= x 6)), 16823#(and (<= 7 x) (<= x 7)), 16824#(and (<= x 8) (<= 8 x)), 16825#(and (<= 9 x) (<= x 9)), 16826#(and (<= 10 x) (<= x 10)), 16827#(and (<= x 11) (<= 11 x)), 16828#(and (<= 12 x) (<= x 12)), 16829#(and (<= 13 x) (<= x 13)), 16830#(and (<= 14 x) (<= x 14)), 16831#(and (<= x 15) (<= 15 x)), 16832#(and (<= x 16) (<= 16 x)), 16833#(and (<= x 17) (<= 17 x)), 16834#(and (<= 18 x) (<= x 18)), 16835#(and (<= x 19) (<= 19 x)), 16836#(and (<= 20 x) (<= x 20)), 16837#(and (<= x 21) (<= 21 x)), 16838#(and (<= x 22) (<= 22 x)), 16839#(and (<= 23 x) (<= x 23)), 16840#(and (<= 24 x) (<= x 24)), 16841#(and (<= x 25) (<= 25 x)), 16842#(and (<= x 26) (<= 26 x)), 16843#(and (<= 27 x) (<= x 27)), 16844#(and (<= x 28) (<= 28 x)), 16845#(and (<= x 29) (<= 29 x)), 16846#(and (<= x 30) (<= 30 x)), 16847#(and (<= 31 x) (<= x 31)), 16848#(and (<= x 32) (<= 32 x)), 16849#(and (<= x 33) (<= 33 x)), 16850#(and (<= x 34) (<= 34 x)), 16851#(and (<= 35 x) (<= x 35)), 16852#(and (<= 36 x) (<= x 36)), 16853#(and (<= 37 x) (<= x 37)), 16854#(and (<= 38 x) (<= x 38)), 16855#(and (<= x 39) (<= 39 x)), 16856#(and (<= 40 x) (<= x 40)), 16857#(and (<= 41 x) (<= x 41)), 16858#(and (<= 42 x) (<= x 42)), 16859#(and (<= x 43) (<= 43 x)), 16860#(and (<= x 44) (<= 44 x)), 16861#(and (<= 45 x) (<= x 45)), 16862#(and (<= 46 x) (<= x 46)), 16863#(and (<= x 47) (<= 47 x)), 16864#(and (<= x 48) (<= 48 x)), 16865#(and (<= 49 x) (<= x 49)), 16866#(and (<= 50 x) (<= x 50)), 16867#(and (<= x 51) (<= 51 x)), 16868#(and (<= 52 x) (<= x 52)), 16869#(and (<= x 53) (<= 53 x)), 16870#(and (<= 54 x) (<= x 54)), 16871#(and (<= x 55) (<= 55 x)), 16872#(and (<= 56 x) (<= x 56)), 16873#(and (<= 57 x) (<= x 57)), 16874#(and (<= x 58) (<= 58 x)), 16875#(and (<= x 59) (<= 59 x)), 16876#(and (<= 60 x) (<= x 60)), 16877#(and (<= 61 x) (<= x 61)), 16878#(and (<= 62 x) (<= x 62)), 16879#(and (<= 63 x) (<= x 63)), 16880#(and (<= 64 x) (<= x 64)), 16881#(and (<= 65 x) (<= x 65)), 16882#(and (<= x 66) (<= 66 x)), 16883#(and (<= x 67) (<= 67 x)), 16884#(and (<= 68 x) (<= x 68)), 16885#(and (<= 69 x) (<= x 69)), 16886#(and (<= 70 x) (<= x 70)), 16887#(and (<= x 71) (<= 71 x)), 16888#(and (<= x 72) (<= 72 x)), 16889#(and (<= x 73) (<= 73 x)), 16890#(<= x 74), 16891#(<= x 75)] [2018-07-23 13:51:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:01,269 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 13:51:01,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 13:51:01,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=5704, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:51:01,270 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 78 states. [2018-07-23 13:51:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:01,735 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-23 13:51:01,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 13:51:01,735 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-07-23 13:51:01,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:01,736 INFO L225 Difference]: With dead ends: 86 [2018-07-23 13:51:01,736 INFO L226 Difference]: Without dead ends: 82 [2018-07-23 13:51:01,736 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=5704, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:51:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-23 13:51:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-23 13:51:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-23 13:51:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-23 13:51:01,740 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2018-07-23 13:51:01,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:01,741 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-23 13:51:01,741 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 13:51:01,741 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-23 13:51:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-23 13:51:01,742 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:01,742 INFO L357 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-07-23 13:51:01,742 INFO L414 AbstractCegarLoop]: === Iteration 77 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:01,742 INFO L82 PathProgramCache]: Analyzing trace with hash 940484192, now seen corresponding path program 76 times [2018-07-23 13:51:01,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:02,203 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:02,203 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 13:51:02,203 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:02,204 INFO L185 omatonBuilderFactory]: Interpolants [17280#(and (<= 50 x) (<= x 50)), 17281#(and (<= x 51) (<= 51 x)), 17282#(and (<= 52 x) (<= x 52)), 17283#(and (<= x 53) (<= 53 x)), 17284#(and (<= 54 x) (<= x 54)), 17285#(and (<= x 55) (<= 55 x)), 17286#(and (<= 56 x) (<= x 56)), 17287#(and (<= 57 x) (<= x 57)), 17288#(and (<= x 58) (<= 58 x)), 17289#(and (<= x 59) (<= 59 x)), 17290#(and (<= 60 x) (<= x 60)), 17291#(and (<= 61 x) (<= x 61)), 17292#(and (<= 62 x) (<= x 62)), 17293#(and (<= 63 x) (<= x 63)), 17294#(and (<= 64 x) (<= x 64)), 17295#(and (<= 65 x) (<= x 65)), 17296#(and (<= x 66) (<= 66 x)), 17297#(and (<= x 67) (<= 67 x)), 17298#(and (<= 68 x) (<= x 68)), 17299#(and (<= 69 x) (<= x 69)), 17300#(and (<= 70 x) (<= x 70)), 17301#(and (<= x 71) (<= 71 x)), 17302#(and (<= x 72) (<= 72 x)), 17303#(and (<= x 73) (<= 73 x)), 17304#(and (<= x 74) (<= 74 x)), 17305#(<= x 75), 17306#(<= x 76), 17228#true, 17229#false, 17230#(and (<= 0 x) (<= x 0)), 17231#(and (<= x 1) (<= 1 x)), 17232#(and (<= 2 x) (<= x 2)), 17233#(and (<= 3 x) (<= x 3)), 17234#(and (<= x 4) (<= 4 x)), 17235#(and (<= x 5) (<= 5 x)), 17236#(and (<= 6 x) (<= x 6)), 17237#(and (<= 7 x) (<= x 7)), 17238#(and (<= x 8) (<= 8 x)), 17239#(and (<= 9 x) (<= x 9)), 17240#(and (<= 10 x) (<= x 10)), 17241#(and (<= x 11) (<= 11 x)), 17242#(and (<= 12 x) (<= x 12)), 17243#(and (<= 13 x) (<= x 13)), 17244#(and (<= 14 x) (<= x 14)), 17245#(and (<= x 15) (<= 15 x)), 17246#(and (<= x 16) (<= 16 x)), 17247#(and (<= x 17) (<= 17 x)), 17248#(and (<= 18 x) (<= x 18)), 17249#(and (<= x 19) (<= 19 x)), 17250#(and (<= 20 x) (<= x 20)), 17251#(and (<= x 21) (<= 21 x)), 17252#(and (<= x 22) (<= 22 x)), 17253#(and (<= 23 x) (<= x 23)), 17254#(and (<= 24 x) (<= x 24)), 17255#(and (<= x 25) (<= 25 x)), 17256#(and (<= x 26) (<= 26 x)), 17257#(and (<= 27 x) (<= x 27)), 17258#(and (<= x 28) (<= 28 x)), 17259#(and (<= x 29) (<= 29 x)), 17260#(and (<= x 30) (<= 30 x)), 17261#(and (<= 31 x) (<= x 31)), 17262#(and (<= x 32) (<= 32 x)), 17263#(and (<= x 33) (<= 33 x)), 17264#(and (<= x 34) (<= 34 x)), 17265#(and (<= 35 x) (<= x 35)), 17266#(and (<= 36 x) (<= x 36)), 17267#(and (<= 37 x) (<= x 37)), 17268#(and (<= 38 x) (<= x 38)), 17269#(and (<= x 39) (<= 39 x)), 17270#(and (<= 40 x) (<= x 40)), 17271#(and (<= 41 x) (<= x 41)), 17272#(and (<= 42 x) (<= x 42)), 17273#(and (<= x 43) (<= 43 x)), 17274#(and (<= x 44) (<= 44 x)), 17275#(and (<= 45 x) (<= x 45)), 17276#(and (<= 46 x) (<= x 46)), 17277#(and (<= x 47) (<= 47 x)), 17278#(and (<= x 48) (<= 48 x)), 17279#(and (<= 49 x) (<= x 49))] [2018-07-23 13:51:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:02,205 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 13:51:02,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 13:51:02,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=5856, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:51:02,206 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 79 states. [2018-07-23 13:51:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:02,631 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-23 13:51:02,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 13:51:02,632 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-07-23 13:51:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:02,632 INFO L225 Difference]: With dead ends: 87 [2018-07-23 13:51:02,632 INFO L226 Difference]: Without dead ends: 83 [2018-07-23 13:51:02,633 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=5856, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:51:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-23 13:51:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-23 13:51:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-23 13:51:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-23 13:51:02,638 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2018-07-23 13:51:02,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:02,638 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-23 13:51:02,638 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 13:51:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-23 13:51:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-23 13:51:02,639 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:02,639 INFO L357 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-07-23 13:51:02,640 INFO L414 AbstractCegarLoop]: === Iteration 78 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:02,640 INFO L82 PathProgramCache]: Analyzing trace with hash -909753450, now seen corresponding path program 77 times [2018-07-23 13:51:02,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:03,146 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:03,146 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 13:51:03,146 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:03,147 INFO L185 omatonBuilderFactory]: Interpolants [17664#(and (<= x 15) (<= 15 x)), 17665#(and (<= x 16) (<= 16 x)), 17666#(and (<= x 17) (<= 17 x)), 17667#(and (<= 18 x) (<= x 18)), 17668#(and (<= x 19) (<= 19 x)), 17669#(and (<= 20 x) (<= x 20)), 17670#(and (<= x 21) (<= 21 x)), 17671#(and (<= x 22) (<= 22 x)), 17672#(and (<= 23 x) (<= x 23)), 17673#(and (<= 24 x) (<= x 24)), 17674#(and (<= x 25) (<= 25 x)), 17675#(and (<= x 26) (<= 26 x)), 17676#(and (<= 27 x) (<= x 27)), 17677#(and (<= x 28) (<= 28 x)), 17678#(and (<= x 29) (<= 29 x)), 17679#(and (<= x 30) (<= 30 x)), 17680#(and (<= 31 x) (<= x 31)), 17681#(and (<= x 32) (<= 32 x)), 17682#(and (<= x 33) (<= 33 x)), 17683#(and (<= x 34) (<= 34 x)), 17684#(and (<= 35 x) (<= x 35)), 17685#(and (<= 36 x) (<= x 36)), 17686#(and (<= 37 x) (<= x 37)), 17687#(and (<= 38 x) (<= x 38)), 17688#(and (<= x 39) (<= 39 x)), 17689#(and (<= 40 x) (<= x 40)), 17690#(and (<= 41 x) (<= x 41)), 17691#(and (<= 42 x) (<= x 42)), 17692#(and (<= x 43) (<= 43 x)), 17693#(and (<= x 44) (<= 44 x)), 17694#(and (<= 45 x) (<= x 45)), 17695#(and (<= 46 x) (<= x 46)), 17696#(and (<= x 47) (<= 47 x)), 17697#(and (<= x 48) (<= 48 x)), 17698#(and (<= 49 x) (<= x 49)), 17699#(and (<= 50 x) (<= x 50)), 17700#(and (<= x 51) (<= 51 x)), 17701#(and (<= 52 x) (<= x 52)), 17702#(and (<= x 53) (<= 53 x)), 17703#(and (<= 54 x) (<= x 54)), 17704#(and (<= x 55) (<= 55 x)), 17705#(and (<= 56 x) (<= x 56)), 17706#(and (<= 57 x) (<= x 57)), 17707#(and (<= x 58) (<= 58 x)), 17708#(and (<= x 59) (<= 59 x)), 17709#(and (<= 60 x) (<= x 60)), 17710#(and (<= 61 x) (<= x 61)), 17711#(and (<= 62 x) (<= x 62)), 17712#(and (<= 63 x) (<= x 63)), 17713#(and (<= 64 x) (<= x 64)), 17714#(and (<= 65 x) (<= x 65)), 17715#(and (<= x 66) (<= 66 x)), 17716#(and (<= x 67) (<= 67 x)), 17717#(and (<= 68 x) (<= x 68)), 17718#(and (<= 69 x) (<= x 69)), 17719#(and (<= 70 x) (<= x 70)), 17720#(and (<= x 71) (<= 71 x)), 17721#(and (<= x 72) (<= 72 x)), 17722#(and (<= x 73) (<= 73 x)), 17723#(and (<= x 74) (<= 74 x)), 17724#(and (<= x 75) (<= 75 x)), 17725#(<= x 76), 17726#(<= x 77), 17647#true, 17648#false, 17649#(and (<= 0 x) (<= x 0)), 17650#(and (<= x 1) (<= 1 x)), 17651#(and (<= 2 x) (<= x 2)), 17652#(and (<= 3 x) (<= x 3)), 17653#(and (<= x 4) (<= 4 x)), 17654#(and (<= x 5) (<= 5 x)), 17655#(and (<= 6 x) (<= x 6)), 17656#(and (<= 7 x) (<= x 7)), 17657#(and (<= x 8) (<= 8 x)), 17658#(and (<= 9 x) (<= x 9)), 17659#(and (<= 10 x) (<= x 10)), 17660#(and (<= x 11) (<= 11 x)), 17661#(and (<= 12 x) (<= x 12)), 17662#(and (<= 13 x) (<= x 13)), 17663#(and (<= 14 x) (<= x 14))] [2018-07-23 13:51:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:03,148 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 13:51:03,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 13:51:03,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=6010, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:51:03,149 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 80 states. [2018-07-23 13:51:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:03,776 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-23 13:51:03,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 13:51:03,776 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-07-23 13:51:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:03,777 INFO L225 Difference]: With dead ends: 88 [2018-07-23 13:51:03,777 INFO L226 Difference]: Without dead ends: 84 [2018-07-23 13:51:03,778 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=310, Invalid=6010, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:51:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-23 13:51:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-23 13:51:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-23 13:51:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-23 13:51:03,783 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2018-07-23 13:51:03,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:03,783 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-23 13:51:03,783 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 13:51:03,783 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-23 13:51:03,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-23 13:51:03,784 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:03,784 INFO L357 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-07-23 13:51:03,784 INFO L414 AbstractCegarLoop]: === Iteration 79 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:03,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1862421792, now seen corresponding path program 78 times [2018-07-23 13:51:03,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:04,209 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:04,209 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 13:51:04,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:04,210 INFO L185 omatonBuilderFactory]: Interpolants [18071#true, 18072#false, 18073#(and (<= 0 x) (<= x 0)), 18074#(and (<= x 1) (<= 1 x)), 18075#(and (<= 2 x) (<= x 2)), 18076#(and (<= 3 x) (<= x 3)), 18077#(and (<= x 4) (<= 4 x)), 18078#(and (<= x 5) (<= 5 x)), 18079#(and (<= 6 x) (<= x 6)), 18080#(and (<= 7 x) (<= x 7)), 18081#(and (<= x 8) (<= 8 x)), 18082#(and (<= 9 x) (<= x 9)), 18083#(and (<= 10 x) (<= x 10)), 18084#(and (<= x 11) (<= 11 x)), 18085#(and (<= 12 x) (<= x 12)), 18086#(and (<= 13 x) (<= x 13)), 18087#(and (<= 14 x) (<= x 14)), 18088#(and (<= x 15) (<= 15 x)), 18089#(and (<= x 16) (<= 16 x)), 18090#(and (<= x 17) (<= 17 x)), 18091#(and (<= 18 x) (<= x 18)), 18092#(and (<= x 19) (<= 19 x)), 18093#(and (<= 20 x) (<= x 20)), 18094#(and (<= x 21) (<= 21 x)), 18095#(and (<= x 22) (<= 22 x)), 18096#(and (<= 23 x) (<= x 23)), 18097#(and (<= 24 x) (<= x 24)), 18098#(and (<= x 25) (<= 25 x)), 18099#(and (<= x 26) (<= 26 x)), 18100#(and (<= 27 x) (<= x 27)), 18101#(and (<= x 28) (<= 28 x)), 18102#(and (<= x 29) (<= 29 x)), 18103#(and (<= x 30) (<= 30 x)), 18104#(and (<= 31 x) (<= x 31)), 18105#(and (<= x 32) (<= 32 x)), 18106#(and (<= x 33) (<= 33 x)), 18107#(and (<= x 34) (<= 34 x)), 18108#(and (<= 35 x) (<= x 35)), 18109#(and (<= 36 x) (<= x 36)), 18110#(and (<= 37 x) (<= x 37)), 18111#(and (<= 38 x) (<= x 38)), 18112#(and (<= x 39) (<= 39 x)), 18113#(and (<= 40 x) (<= x 40)), 18114#(and (<= 41 x) (<= x 41)), 18115#(and (<= 42 x) (<= x 42)), 18116#(and (<= x 43) (<= 43 x)), 18117#(and (<= x 44) (<= 44 x)), 18118#(and (<= 45 x) (<= x 45)), 18119#(and (<= 46 x) (<= x 46)), 18120#(and (<= x 47) (<= 47 x)), 18121#(and (<= x 48) (<= 48 x)), 18122#(and (<= 49 x) (<= x 49)), 18123#(and (<= 50 x) (<= x 50)), 18124#(and (<= x 51) (<= 51 x)), 18125#(and (<= 52 x) (<= x 52)), 18126#(and (<= x 53) (<= 53 x)), 18127#(and (<= 54 x) (<= x 54)), 18128#(and (<= x 55) (<= 55 x)), 18129#(and (<= 56 x) (<= x 56)), 18130#(and (<= 57 x) (<= x 57)), 18131#(and (<= x 58) (<= 58 x)), 18132#(and (<= x 59) (<= 59 x)), 18133#(and (<= 60 x) (<= x 60)), 18134#(and (<= 61 x) (<= x 61)), 18135#(and (<= 62 x) (<= x 62)), 18136#(and (<= 63 x) (<= x 63)), 18137#(and (<= 64 x) (<= x 64)), 18138#(and (<= 65 x) (<= x 65)), 18139#(and (<= x 66) (<= 66 x)), 18140#(and (<= x 67) (<= 67 x)), 18141#(and (<= 68 x) (<= x 68)), 18142#(and (<= 69 x) (<= x 69)), 18143#(and (<= 70 x) (<= x 70)), 18144#(and (<= x 71) (<= 71 x)), 18145#(and (<= x 72) (<= 72 x)), 18146#(and (<= x 73) (<= 73 x)), 18147#(and (<= x 74) (<= 74 x)), 18148#(and (<= x 75) (<= 75 x)), 18149#(and (<= x 76) (<= 76 x)), 18150#(<= x 77), 18151#(<= x 78)] [2018-07-23 13:51:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:04,210 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 13:51:04,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 13:51:04,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=6166, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:51:04,211 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 81 states. [2018-07-23 13:51:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:04,648 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-23 13:51:04,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 13:51:04,649 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-07-23 13:51:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:04,649 INFO L225 Difference]: With dead ends: 89 [2018-07-23 13:51:04,649 INFO L226 Difference]: Without dead ends: 85 [2018-07-23 13:51:04,650 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=314, Invalid=6166, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:51:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-23 13:51:04,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-23 13:51:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 13:51:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-23 13:51:04,657 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2018-07-23 13:51:04,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:04,657 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-23 13:51:04,657 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 13:51:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-23 13:51:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-23 13:51:04,658 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:04,658 INFO L357 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-07-23 13:51:04,658 INFO L414 AbstractCegarLoop]: === Iteration 80 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:04,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1900508374, now seen corresponding path program 79 times [2018-07-23 13:51:04,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:05,145 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:05,145 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 13:51:05,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:05,146 INFO L185 omatonBuilderFactory]: Interpolants [18560#(and (<= x 58) (<= 58 x)), 18561#(and (<= x 59) (<= 59 x)), 18562#(and (<= 60 x) (<= x 60)), 18563#(and (<= 61 x) (<= x 61)), 18564#(and (<= 62 x) (<= x 62)), 18565#(and (<= 63 x) (<= x 63)), 18566#(and (<= 64 x) (<= x 64)), 18567#(and (<= 65 x) (<= x 65)), 18568#(and (<= x 66) (<= 66 x)), 18569#(and (<= x 67) (<= 67 x)), 18570#(and (<= 68 x) (<= x 68)), 18571#(and (<= 69 x) (<= x 69)), 18572#(and (<= 70 x) (<= x 70)), 18573#(and (<= x 71) (<= 71 x)), 18574#(and (<= x 72) (<= 72 x)), 18575#(and (<= x 73) (<= 73 x)), 18576#(and (<= x 74) (<= 74 x)), 18577#(and (<= x 75) (<= 75 x)), 18578#(and (<= x 76) (<= 76 x)), 18579#(and (<= x 77) (<= 77 x)), 18580#(<= x 78), 18581#(<= x 79), 18500#true, 18501#false, 18502#(and (<= 0 x) (<= x 0)), 18503#(and (<= x 1) (<= 1 x)), 18504#(and (<= 2 x) (<= x 2)), 18505#(and (<= 3 x) (<= x 3)), 18506#(and (<= x 4) (<= 4 x)), 18507#(and (<= x 5) (<= 5 x)), 18508#(and (<= 6 x) (<= x 6)), 18509#(and (<= 7 x) (<= x 7)), 18510#(and (<= x 8) (<= 8 x)), 18511#(and (<= 9 x) (<= x 9)), 18512#(and (<= 10 x) (<= x 10)), 18513#(and (<= x 11) (<= 11 x)), 18514#(and (<= 12 x) (<= x 12)), 18515#(and (<= 13 x) (<= x 13)), 18516#(and (<= 14 x) (<= x 14)), 18517#(and (<= x 15) (<= 15 x)), 18518#(and (<= x 16) (<= 16 x)), 18519#(and (<= x 17) (<= 17 x)), 18520#(and (<= 18 x) (<= x 18)), 18521#(and (<= x 19) (<= 19 x)), 18522#(and (<= 20 x) (<= x 20)), 18523#(and (<= x 21) (<= 21 x)), 18524#(and (<= x 22) (<= 22 x)), 18525#(and (<= 23 x) (<= x 23)), 18526#(and (<= 24 x) (<= x 24)), 18527#(and (<= x 25) (<= 25 x)), 18528#(and (<= x 26) (<= 26 x)), 18529#(and (<= 27 x) (<= x 27)), 18530#(and (<= x 28) (<= 28 x)), 18531#(and (<= x 29) (<= 29 x)), 18532#(and (<= x 30) (<= 30 x)), 18533#(and (<= 31 x) (<= x 31)), 18534#(and (<= x 32) (<= 32 x)), 18535#(and (<= x 33) (<= 33 x)), 18536#(and (<= x 34) (<= 34 x)), 18537#(and (<= 35 x) (<= x 35)), 18538#(and (<= 36 x) (<= x 36)), 18539#(and (<= 37 x) (<= x 37)), 18540#(and (<= 38 x) (<= x 38)), 18541#(and (<= x 39) (<= 39 x)), 18542#(and (<= 40 x) (<= x 40)), 18543#(and (<= 41 x) (<= x 41)), 18544#(and (<= 42 x) (<= x 42)), 18545#(and (<= x 43) (<= 43 x)), 18546#(and (<= x 44) (<= 44 x)), 18547#(and (<= 45 x) (<= x 45)), 18548#(and (<= 46 x) (<= x 46)), 18549#(and (<= x 47) (<= 47 x)), 18550#(and (<= x 48) (<= 48 x)), 18551#(and (<= 49 x) (<= x 49)), 18552#(and (<= 50 x) (<= x 50)), 18553#(and (<= x 51) (<= 51 x)), 18554#(and (<= 52 x) (<= x 52)), 18555#(and (<= x 53) (<= 53 x)), 18556#(and (<= 54 x) (<= x 54)), 18557#(and (<= x 55) (<= 55 x)), 18558#(and (<= 56 x) (<= x 56)), 18559#(and (<= 57 x) (<= x 57))] [2018-07-23 13:51:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:05,147 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 13:51:05,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 13:51:05,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=6324, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:51:05,148 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 82 states. [2018-07-23 13:51:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:05,606 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-23 13:51:05,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 13:51:05,607 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-07-23 13:51:05,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:05,607 INFO L225 Difference]: With dead ends: 90 [2018-07-23 13:51:05,607 INFO L226 Difference]: Without dead ends: 86 [2018-07-23 13:51:05,608 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=6324, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:51:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-23 13:51:05,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-23 13:51:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-23 13:51:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-23 13:51:05,613 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2018-07-23 13:51:05,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:05,613 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-23 13:51:05,613 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 13:51:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-23 13:51:05,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-23 13:51:05,614 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:05,614 INFO L357 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-07-23 13:51:05,614 INFO L414 AbstractCegarLoop]: === Iteration 81 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:05,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1213774880, now seen corresponding path program 80 times [2018-07-23 13:51:05,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,034 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:06,034 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 13:51:06,035 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,035 INFO L185 omatonBuilderFactory]: Interpolants [18944#(and (<= x 8) (<= 8 x)), 18945#(and (<= 9 x) (<= x 9)), 18946#(and (<= 10 x) (<= x 10)), 18947#(and (<= x 11) (<= 11 x)), 18948#(and (<= 12 x) (<= x 12)), 18949#(and (<= 13 x) (<= x 13)), 18950#(and (<= 14 x) (<= x 14)), 18951#(and (<= x 15) (<= 15 x)), 18952#(and (<= x 16) (<= 16 x)), 18953#(and (<= x 17) (<= 17 x)), 18954#(and (<= 18 x) (<= x 18)), 18955#(and (<= x 19) (<= 19 x)), 18956#(and (<= 20 x) (<= x 20)), 18957#(and (<= x 21) (<= 21 x)), 18958#(and (<= x 22) (<= 22 x)), 18959#(and (<= 23 x) (<= x 23)), 18960#(and (<= 24 x) (<= x 24)), 18961#(and (<= x 25) (<= 25 x)), 18962#(and (<= x 26) (<= 26 x)), 18963#(and (<= 27 x) (<= x 27)), 18964#(and (<= x 28) (<= 28 x)), 18965#(and (<= x 29) (<= 29 x)), 18966#(and (<= x 30) (<= 30 x)), 18967#(and (<= 31 x) (<= x 31)), 18968#(and (<= x 32) (<= 32 x)), 18969#(and (<= x 33) (<= 33 x)), 18970#(and (<= x 34) (<= 34 x)), 18971#(and (<= 35 x) (<= x 35)), 18972#(and (<= 36 x) (<= x 36)), 18973#(and (<= 37 x) (<= x 37)), 18974#(and (<= 38 x) (<= x 38)), 18975#(and (<= x 39) (<= 39 x)), 18976#(and (<= 40 x) (<= x 40)), 18977#(and (<= 41 x) (<= x 41)), 18978#(and (<= 42 x) (<= x 42)), 18979#(and (<= x 43) (<= 43 x)), 18980#(and (<= x 44) (<= 44 x)), 18981#(and (<= 45 x) (<= x 45)), 18982#(and (<= 46 x) (<= x 46)), 18983#(and (<= x 47) (<= 47 x)), 18984#(and (<= x 48) (<= 48 x)), 18985#(and (<= 49 x) (<= x 49)), 18986#(and (<= 50 x) (<= x 50)), 18987#(and (<= x 51) (<= 51 x)), 18988#(and (<= 52 x) (<= x 52)), 18989#(and (<= x 53) (<= 53 x)), 18990#(and (<= 54 x) (<= x 54)), 18991#(and (<= x 55) (<= 55 x)), 18992#(and (<= 56 x) (<= x 56)), 18993#(and (<= 57 x) (<= x 57)), 18994#(and (<= x 58) (<= 58 x)), 18995#(and (<= x 59) (<= 59 x)), 18996#(and (<= 60 x) (<= x 60)), 18997#(and (<= 61 x) (<= x 61)), 18998#(and (<= 62 x) (<= x 62)), 18999#(and (<= 63 x) (<= x 63)), 19000#(and (<= 64 x) (<= x 64)), 19001#(and (<= 65 x) (<= x 65)), 19002#(and (<= x 66) (<= 66 x)), 19003#(and (<= x 67) (<= 67 x)), 19004#(and (<= 68 x) (<= x 68)), 19005#(and (<= 69 x) (<= x 69)), 19006#(and (<= 70 x) (<= x 70)), 19007#(and (<= x 71) (<= 71 x)), 19008#(and (<= x 72) (<= 72 x)), 19009#(and (<= x 73) (<= 73 x)), 19010#(and (<= x 74) (<= 74 x)), 19011#(and (<= x 75) (<= 75 x)), 19012#(and (<= x 76) (<= 76 x)), 19013#(and (<= x 77) (<= 77 x)), 19014#(and (<= 78 x) (<= x 78)), 19015#(<= x 79), 19016#(<= x 80), 18934#true, 18935#false, 18936#(and (<= 0 x) (<= x 0)), 18937#(and (<= x 1) (<= 1 x)), 18938#(and (<= 2 x) (<= x 2)), 18939#(and (<= 3 x) (<= x 3)), 18940#(and (<= x 4) (<= 4 x)), 18941#(and (<= x 5) (<= 5 x)), 18942#(and (<= 6 x) (<= x 6)), 18943#(and (<= 7 x) (<= x 7))] [2018-07-23 13:51:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,036 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 13:51:06,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 13:51:06,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=6484, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:51:06,037 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 83 states. [2018-07-23 13:51:06,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:06,477 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-23 13:51:06,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 13:51:06,477 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-07-23 13:51:06,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:06,477 INFO L225 Difference]: With dead ends: 91 [2018-07-23 13:51:06,478 INFO L226 Difference]: Without dead ends: 87 [2018-07-23 13:51:06,478 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=322, Invalid=6484, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:51:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-23 13:51:06,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-23 13:51:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-23 13:51:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-23 13:51:06,482 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2018-07-23 13:51:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:06,482 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-23 13:51:06,482 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 13:51:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-23 13:51:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-23 13:51:06,483 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:06,483 INFO L357 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-07-23 13:51:06,483 INFO L414 AbstractCegarLoop]: === Iteration 82 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:06,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1027692054, now seen corresponding path program 81 times [2018-07-23 13:51:06,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:06,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 13:51:06,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:06,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,948 INFO L185 omatonBuilderFactory]: Interpolants [19456#(<= x 81), 19373#true, 19374#false, 19375#(and (<= 0 x) (<= x 0)), 19376#(and (<= x 1) (<= 1 x)), 19377#(and (<= 2 x) (<= x 2)), 19378#(and (<= 3 x) (<= x 3)), 19379#(and (<= x 4) (<= 4 x)), 19380#(and (<= x 5) (<= 5 x)), 19381#(and (<= 6 x) (<= x 6)), 19382#(and (<= 7 x) (<= x 7)), 19383#(and (<= x 8) (<= 8 x)), 19384#(and (<= 9 x) (<= x 9)), 19385#(and (<= 10 x) (<= x 10)), 19386#(and (<= x 11) (<= 11 x)), 19387#(and (<= 12 x) (<= x 12)), 19388#(and (<= 13 x) (<= x 13)), 19389#(and (<= 14 x) (<= x 14)), 19390#(and (<= x 15) (<= 15 x)), 19391#(and (<= x 16) (<= 16 x)), 19392#(and (<= x 17) (<= 17 x)), 19393#(and (<= 18 x) (<= x 18)), 19394#(and (<= x 19) (<= 19 x)), 19395#(and (<= 20 x) (<= x 20)), 19396#(and (<= x 21) (<= 21 x)), 19397#(and (<= x 22) (<= 22 x)), 19398#(and (<= 23 x) (<= x 23)), 19399#(and (<= 24 x) (<= x 24)), 19400#(and (<= x 25) (<= 25 x)), 19401#(and (<= x 26) (<= 26 x)), 19402#(and (<= 27 x) (<= x 27)), 19403#(and (<= x 28) (<= 28 x)), 19404#(and (<= x 29) (<= 29 x)), 19405#(and (<= x 30) (<= 30 x)), 19406#(and (<= 31 x) (<= x 31)), 19407#(and (<= x 32) (<= 32 x)), 19408#(and (<= x 33) (<= 33 x)), 19409#(and (<= x 34) (<= 34 x)), 19410#(and (<= 35 x) (<= x 35)), 19411#(and (<= 36 x) (<= x 36)), 19412#(and (<= 37 x) (<= x 37)), 19413#(and (<= 38 x) (<= x 38)), 19414#(and (<= x 39) (<= 39 x)), 19415#(and (<= 40 x) (<= x 40)), 19416#(and (<= 41 x) (<= x 41)), 19417#(and (<= 42 x) (<= x 42)), 19418#(and (<= x 43) (<= 43 x)), 19419#(and (<= x 44) (<= 44 x)), 19420#(and (<= 45 x) (<= x 45)), 19421#(and (<= 46 x) (<= x 46)), 19422#(and (<= x 47) (<= 47 x)), 19423#(and (<= x 48) (<= 48 x)), 19424#(and (<= 49 x) (<= x 49)), 19425#(and (<= 50 x) (<= x 50)), 19426#(and (<= x 51) (<= 51 x)), 19427#(and (<= 52 x) (<= x 52)), 19428#(and (<= x 53) (<= 53 x)), 19429#(and (<= 54 x) (<= x 54)), 19430#(and (<= x 55) (<= 55 x)), 19431#(and (<= 56 x) (<= x 56)), 19432#(and (<= 57 x) (<= x 57)), 19433#(and (<= x 58) (<= 58 x)), 19434#(and (<= x 59) (<= 59 x)), 19435#(and (<= 60 x) (<= x 60)), 19436#(and (<= 61 x) (<= x 61)), 19437#(and (<= 62 x) (<= x 62)), 19438#(and (<= 63 x) (<= x 63)), 19439#(and (<= 64 x) (<= x 64)), 19440#(and (<= 65 x) (<= x 65)), 19441#(and (<= x 66) (<= 66 x)), 19442#(and (<= x 67) (<= 67 x)), 19443#(and (<= 68 x) (<= x 68)), 19444#(and (<= 69 x) (<= x 69)), 19445#(and (<= 70 x) (<= x 70)), 19446#(and (<= x 71) (<= 71 x)), 19447#(and (<= x 72) (<= 72 x)), 19448#(and (<= x 73) (<= 73 x)), 19449#(and (<= x 74) (<= 74 x)), 19450#(and (<= x 75) (<= 75 x)), 19451#(and (<= x 76) (<= 76 x)), 19452#(and (<= x 77) (<= 77 x)), 19453#(and (<= 78 x) (<= x 78)), 19454#(and (<= 79 x) (<= x 79)), 19455#(<= x 80)] [2018-07-23 13:51:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,949 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 13:51:06,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 13:51:06,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=6646, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:51:06,950 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 84 states. [2018-07-23 13:51:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:07,396 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-23 13:51:07,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 13:51:07,396 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-07-23 13:51:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:07,397 INFO L225 Difference]: With dead ends: 92 [2018-07-23 13:51:07,397 INFO L226 Difference]: Without dead ends: 88 [2018-07-23 13:51:07,398 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=326, Invalid=6646, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:51:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-23 13:51:07,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-23 13:51:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-23 13:51:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-23 13:51:07,401 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2018-07-23 13:51:07,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:07,402 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-23 13:51:07,402 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 13:51:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-23 13:51:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-23 13:51:07,402 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:07,402 INFO L357 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-07-23 13:51:07,403 INFO L414 AbstractCegarLoop]: === Iteration 83 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:07,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1793690272, now seen corresponding path program 82 times [2018-07-23 13:51:07,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:07,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:07,854 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:07,854 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 13:51:07,854 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:07,854 INFO L185 omatonBuilderFactory]: Interpolants [19840#(and (<= x 21) (<= 21 x)), 19841#(and (<= x 22) (<= 22 x)), 19842#(and (<= 23 x) (<= x 23)), 19843#(and (<= 24 x) (<= x 24)), 19844#(and (<= x 25) (<= 25 x)), 19845#(and (<= x 26) (<= 26 x)), 19846#(and (<= 27 x) (<= x 27)), 19847#(and (<= x 28) (<= 28 x)), 19848#(and (<= x 29) (<= 29 x)), 19849#(and (<= x 30) (<= 30 x)), 19850#(and (<= 31 x) (<= x 31)), 19851#(and (<= x 32) (<= 32 x)), 19852#(and (<= x 33) (<= 33 x)), 19853#(and (<= x 34) (<= 34 x)), 19854#(and (<= 35 x) (<= x 35)), 19855#(and (<= 36 x) (<= x 36)), 19856#(and (<= 37 x) (<= x 37)), 19857#(and (<= 38 x) (<= x 38)), 19858#(and (<= x 39) (<= 39 x)), 19859#(and (<= 40 x) (<= x 40)), 19860#(and (<= 41 x) (<= x 41)), 19861#(and (<= 42 x) (<= x 42)), 19862#(and (<= x 43) (<= 43 x)), 19863#(and (<= x 44) (<= 44 x)), 19864#(and (<= 45 x) (<= x 45)), 19865#(and (<= 46 x) (<= x 46)), 19866#(and (<= x 47) (<= 47 x)), 19867#(and (<= x 48) (<= 48 x)), 19868#(and (<= 49 x) (<= x 49)), 19869#(and (<= 50 x) (<= x 50)), 19870#(and (<= x 51) (<= 51 x)), 19871#(and (<= 52 x) (<= x 52)), 19872#(and (<= x 53) (<= 53 x)), 19873#(and (<= 54 x) (<= x 54)), 19874#(and (<= x 55) (<= 55 x)), 19875#(and (<= 56 x) (<= x 56)), 19876#(and (<= 57 x) (<= x 57)), 19877#(and (<= x 58) (<= 58 x)), 19878#(and (<= x 59) (<= 59 x)), 19879#(and (<= 60 x) (<= x 60)), 19880#(and (<= 61 x) (<= x 61)), 19881#(and (<= 62 x) (<= x 62)), 19882#(and (<= 63 x) (<= x 63)), 19883#(and (<= 64 x) (<= x 64)), 19884#(and (<= 65 x) (<= x 65)), 19885#(and (<= x 66) (<= 66 x)), 19886#(and (<= x 67) (<= 67 x)), 19887#(and (<= 68 x) (<= x 68)), 19888#(and (<= 69 x) (<= x 69)), 19889#(and (<= 70 x) (<= x 70)), 19890#(and (<= x 71) (<= 71 x)), 19891#(and (<= x 72) (<= 72 x)), 19892#(and (<= x 73) (<= 73 x)), 19893#(and (<= x 74) (<= 74 x)), 19894#(and (<= x 75) (<= 75 x)), 19895#(and (<= x 76) (<= 76 x)), 19896#(and (<= x 77) (<= 77 x)), 19897#(and (<= 78 x) (<= x 78)), 19898#(and (<= 79 x) (<= x 79)), 19899#(and (<= 80 x) (<= x 80)), 19900#(<= x 81), 19901#(<= x 82), 19817#true, 19818#false, 19819#(and (<= 0 x) (<= x 0)), 19820#(and (<= x 1) (<= 1 x)), 19821#(and (<= 2 x) (<= x 2)), 19822#(and (<= 3 x) (<= x 3)), 19823#(and (<= x 4) (<= 4 x)), 19824#(and (<= x 5) (<= 5 x)), 19825#(and (<= 6 x) (<= x 6)), 19826#(and (<= 7 x) (<= x 7)), 19827#(and (<= x 8) (<= 8 x)), 19828#(and (<= 9 x) (<= x 9)), 19829#(and (<= 10 x) (<= x 10)), 19830#(and (<= x 11) (<= 11 x)), 19831#(and (<= 12 x) (<= x 12)), 19832#(and (<= 13 x) (<= x 13)), 19833#(and (<= 14 x) (<= x 14)), 19834#(and (<= x 15) (<= 15 x)), 19835#(and (<= x 16) (<= 16 x)), 19836#(and (<= x 17) (<= 17 x)), 19837#(and (<= 18 x) (<= x 18)), 19838#(and (<= x 19) (<= 19 x)), 19839#(and (<= 20 x) (<= x 20))] [2018-07-23 13:51:07,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:07,855 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 13:51:07,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 13:51:07,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=6810, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:51:07,855 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 85 states. [2018-07-23 13:51:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:08,300 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-23 13:51:08,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 13:51:08,301 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-07-23 13:51:08,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:08,301 INFO L225 Difference]: With dead ends: 93 [2018-07-23 13:51:08,301 INFO L226 Difference]: Without dead ends: 89 [2018-07-23 13:51:08,302 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=6810, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:51:08,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-23 13:51:08,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-23 13:51:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-23 13:51:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-23 13:51:08,306 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2018-07-23 13:51:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:08,306 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-23 13:51:08,306 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 13:51:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-23 13:51:08,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-23 13:51:08,306 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:08,307 INFO L357 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-07-23 13:51:08,307 INFO L414 AbstractCegarLoop]: === Iteration 84 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:08,307 INFO L82 PathProgramCache]: Analyzing trace with hash -230168746, now seen corresponding path program 83 times [2018-07-23 13:51:08,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:08,702 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:08,702 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 13:51:08,702 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:08,703 INFO L185 omatonBuilderFactory]: Interpolants [20266#true, 20267#false, 20268#(and (<= 0 x) (<= x 0)), 20269#(and (<= x 1) (<= 1 x)), 20270#(and (<= 2 x) (<= x 2)), 20271#(and (<= 3 x) (<= x 3)), 20272#(and (<= x 4) (<= 4 x)), 20273#(and (<= x 5) (<= 5 x)), 20274#(and (<= 6 x) (<= x 6)), 20275#(and (<= 7 x) (<= x 7)), 20276#(and (<= x 8) (<= 8 x)), 20277#(and (<= 9 x) (<= x 9)), 20278#(and (<= 10 x) (<= x 10)), 20279#(and (<= x 11) (<= 11 x)), 20280#(and (<= 12 x) (<= x 12)), 20281#(and (<= 13 x) (<= x 13)), 20282#(and (<= 14 x) (<= x 14)), 20283#(and (<= x 15) (<= 15 x)), 20284#(and (<= x 16) (<= 16 x)), 20285#(and (<= x 17) (<= 17 x)), 20286#(and (<= 18 x) (<= x 18)), 20287#(and (<= x 19) (<= 19 x)), 20288#(and (<= 20 x) (<= x 20)), 20289#(and (<= x 21) (<= 21 x)), 20290#(and (<= x 22) (<= 22 x)), 20291#(and (<= 23 x) (<= x 23)), 20292#(and (<= 24 x) (<= x 24)), 20293#(and (<= x 25) (<= 25 x)), 20294#(and (<= x 26) (<= 26 x)), 20295#(and (<= 27 x) (<= x 27)), 20296#(and (<= x 28) (<= 28 x)), 20297#(and (<= x 29) (<= 29 x)), 20298#(and (<= x 30) (<= 30 x)), 20299#(and (<= 31 x) (<= x 31)), 20300#(and (<= x 32) (<= 32 x)), 20301#(and (<= x 33) (<= 33 x)), 20302#(and (<= x 34) (<= 34 x)), 20303#(and (<= 35 x) (<= x 35)), 20304#(and (<= 36 x) (<= x 36)), 20305#(and (<= 37 x) (<= x 37)), 20306#(and (<= 38 x) (<= x 38)), 20307#(and (<= x 39) (<= 39 x)), 20308#(and (<= 40 x) (<= x 40)), 20309#(and (<= 41 x) (<= x 41)), 20310#(and (<= 42 x) (<= x 42)), 20311#(and (<= x 43) (<= 43 x)), 20312#(and (<= x 44) (<= 44 x)), 20313#(and (<= 45 x) (<= x 45)), 20314#(and (<= 46 x) (<= x 46)), 20315#(and (<= x 47) (<= 47 x)), 20316#(and (<= x 48) (<= 48 x)), 20317#(and (<= 49 x) (<= x 49)), 20318#(and (<= 50 x) (<= x 50)), 20319#(and (<= x 51) (<= 51 x)), 20320#(and (<= 52 x) (<= x 52)), 20321#(and (<= x 53) (<= 53 x)), 20322#(and (<= 54 x) (<= x 54)), 20323#(and (<= x 55) (<= 55 x)), 20324#(and (<= 56 x) (<= x 56)), 20325#(and (<= 57 x) (<= x 57)), 20326#(and (<= x 58) (<= 58 x)), 20327#(and (<= x 59) (<= 59 x)), 20328#(and (<= 60 x) (<= x 60)), 20329#(and (<= 61 x) (<= x 61)), 20330#(and (<= 62 x) (<= x 62)), 20331#(and (<= 63 x) (<= x 63)), 20332#(and (<= 64 x) (<= x 64)), 20333#(and (<= 65 x) (<= x 65)), 20334#(and (<= x 66) (<= 66 x)), 20335#(and (<= x 67) (<= 67 x)), 20336#(and (<= 68 x) (<= x 68)), 20337#(and (<= 69 x) (<= x 69)), 20338#(and (<= 70 x) (<= x 70)), 20339#(and (<= x 71) (<= 71 x)), 20340#(and (<= x 72) (<= 72 x)), 20341#(and (<= x 73) (<= 73 x)), 20342#(and (<= x 74) (<= 74 x)), 20343#(and (<= x 75) (<= 75 x)), 20344#(and (<= x 76) (<= 76 x)), 20345#(and (<= x 77) (<= 77 x)), 20346#(and (<= 78 x) (<= x 78)), 20347#(and (<= 79 x) (<= x 79)), 20348#(and (<= 80 x) (<= x 80)), 20349#(and (<= x 81) (<= 81 x)), 20350#(<= x 82), 20351#(<= x 83)] [2018-07-23 13:51:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:08,703 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 13:51:08,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 13:51:08,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=6976, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:51:08,704 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 86 states. [2018-07-23 13:51:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:09,167 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-23 13:51:09,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 13:51:09,167 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-07-23 13:51:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:09,168 INFO L225 Difference]: With dead ends: 94 [2018-07-23 13:51:09,168 INFO L226 Difference]: Without dead ends: 90 [2018-07-23 13:51:09,169 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=334, Invalid=6976, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:51:09,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-23 13:51:09,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-23 13:51:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-23 13:51:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-23 13:51:09,172 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2018-07-23 13:51:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:09,172 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-23 13:51:09,172 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 13:51:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-23 13:51:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-23 13:51:09,173 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:09,173 INFO L357 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-07-23 13:51:09,173 INFO L414 AbstractCegarLoop]: === Iteration 85 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:09,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1454711136, now seen corresponding path program 84 times [2018-07-23 13:51:09,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:09,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:09,557 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 13:51:09,557 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:09,558 INFO L185 omatonBuilderFactory]: Interpolants [20736#(and (<= 14 x) (<= x 14)), 20737#(and (<= x 15) (<= 15 x)), 20738#(and (<= x 16) (<= 16 x)), 20739#(and (<= x 17) (<= 17 x)), 20740#(and (<= 18 x) (<= x 18)), 20741#(and (<= x 19) (<= 19 x)), 20742#(and (<= 20 x) (<= x 20)), 20743#(and (<= x 21) (<= 21 x)), 20744#(and (<= x 22) (<= 22 x)), 20745#(and (<= 23 x) (<= x 23)), 20746#(and (<= 24 x) (<= x 24)), 20747#(and (<= x 25) (<= 25 x)), 20748#(and (<= x 26) (<= 26 x)), 20749#(and (<= 27 x) (<= x 27)), 20750#(and (<= x 28) (<= 28 x)), 20751#(and (<= x 29) (<= 29 x)), 20752#(and (<= x 30) (<= 30 x)), 20753#(and (<= 31 x) (<= x 31)), 20754#(and (<= x 32) (<= 32 x)), 20755#(and (<= x 33) (<= 33 x)), 20756#(and (<= x 34) (<= 34 x)), 20757#(and (<= 35 x) (<= x 35)), 20758#(and (<= 36 x) (<= x 36)), 20759#(and (<= 37 x) (<= x 37)), 20760#(and (<= 38 x) (<= x 38)), 20761#(and (<= x 39) (<= 39 x)), 20762#(and (<= 40 x) (<= x 40)), 20763#(and (<= 41 x) (<= x 41)), 20764#(and (<= 42 x) (<= x 42)), 20765#(and (<= x 43) (<= 43 x)), 20766#(and (<= x 44) (<= 44 x)), 20767#(and (<= 45 x) (<= x 45)), 20768#(and (<= 46 x) (<= x 46)), 20769#(and (<= x 47) (<= 47 x)), 20770#(and (<= x 48) (<= 48 x)), 20771#(and (<= 49 x) (<= x 49)), 20772#(and (<= 50 x) (<= x 50)), 20773#(and (<= x 51) (<= 51 x)), 20774#(and (<= 52 x) (<= x 52)), 20775#(and (<= x 53) (<= 53 x)), 20776#(and (<= 54 x) (<= x 54)), 20777#(and (<= x 55) (<= 55 x)), 20778#(and (<= 56 x) (<= x 56)), 20779#(and (<= 57 x) (<= x 57)), 20780#(and (<= x 58) (<= 58 x)), 20781#(and (<= x 59) (<= 59 x)), 20782#(and (<= 60 x) (<= x 60)), 20783#(and (<= 61 x) (<= x 61)), 20784#(and (<= 62 x) (<= x 62)), 20785#(and (<= 63 x) (<= x 63)), 20786#(and (<= 64 x) (<= x 64)), 20787#(and (<= 65 x) (<= x 65)), 20788#(and (<= x 66) (<= 66 x)), 20789#(and (<= x 67) (<= 67 x)), 20790#(and (<= 68 x) (<= x 68)), 20791#(and (<= 69 x) (<= x 69)), 20792#(and (<= 70 x) (<= x 70)), 20793#(and (<= x 71) (<= 71 x)), 20794#(and (<= x 72) (<= 72 x)), 20795#(and (<= x 73) (<= 73 x)), 20796#(and (<= x 74) (<= 74 x)), 20797#(and (<= x 75) (<= 75 x)), 20798#(and (<= x 76) (<= 76 x)), 20799#(and (<= x 77) (<= 77 x)), 20800#(and (<= 78 x) (<= x 78)), 20801#(and (<= 79 x) (<= x 79)), 20802#(and (<= 80 x) (<= x 80)), 20803#(and (<= x 81) (<= 81 x)), 20804#(and (<= 82 x) (<= x 82)), 20805#(<= x 83), 20806#(<= x 84), 20720#true, 20721#false, 20722#(and (<= 0 x) (<= x 0)), 20723#(and (<= x 1) (<= 1 x)), 20724#(and (<= 2 x) (<= x 2)), 20725#(and (<= 3 x) (<= x 3)), 20726#(and (<= x 4) (<= 4 x)), 20727#(and (<= x 5) (<= 5 x)), 20728#(and (<= 6 x) (<= x 6)), 20729#(and (<= 7 x) (<= x 7)), 20730#(and (<= x 8) (<= 8 x)), 20731#(and (<= 9 x) (<= x 9)), 20732#(and (<= 10 x) (<= x 10)), 20733#(and (<= x 11) (<= 11 x)), 20734#(and (<= 12 x) (<= x 12)), 20735#(and (<= 13 x) (<= x 13))] [2018-07-23 13:51:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:09,558 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 13:51:09,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 13:51:09,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=7144, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:51:09,559 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 87 states. [2018-07-23 13:51:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:10,038 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-23 13:51:10,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 13:51:10,038 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-07-23 13:51:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:10,039 INFO L225 Difference]: With dead ends: 95 [2018-07-23 13:51:10,039 INFO L226 Difference]: Without dead ends: 91 [2018-07-23 13:51:10,040 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=7144, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:51:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-23 13:51:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-23 13:51:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-23 13:51:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-23 13:51:10,045 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2018-07-23 13:51:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:10,046 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-23 13:51:10,046 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 13:51:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-23 13:51:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 13:51:10,046 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:10,047 INFO L357 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-07-23 13:51:10,047 INFO L414 AbstractCegarLoop]: === Iteration 86 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:10,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2146379926, now seen corresponding path program 85 times [2018-07-23 13:51:10,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:10,487 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:10,487 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 13:51:10,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:10,488 INFO L185 omatonBuilderFactory]: Interpolants [21248#(and (<= x 67) (<= 67 x)), 21249#(and (<= 68 x) (<= x 68)), 21250#(and (<= 69 x) (<= x 69)), 21251#(and (<= 70 x) (<= x 70)), 21252#(and (<= x 71) (<= 71 x)), 21253#(and (<= x 72) (<= 72 x)), 21254#(and (<= x 73) (<= 73 x)), 21255#(and (<= x 74) (<= 74 x)), 21256#(and (<= x 75) (<= 75 x)), 21257#(and (<= x 76) (<= 76 x)), 21258#(and (<= x 77) (<= 77 x)), 21259#(and (<= 78 x) (<= x 78)), 21260#(and (<= 79 x) (<= x 79)), 21261#(and (<= 80 x) (<= x 80)), 21262#(and (<= x 81) (<= 81 x)), 21263#(and (<= 82 x) (<= x 82)), 21264#(and (<= x 83) (<= 83 x)), 21265#(<= x 84), 21266#(<= x 85), 21179#true, 21180#false, 21181#(and (<= 0 x) (<= x 0)), 21182#(and (<= x 1) (<= 1 x)), 21183#(and (<= 2 x) (<= x 2)), 21184#(and (<= 3 x) (<= x 3)), 21185#(and (<= x 4) (<= 4 x)), 21186#(and (<= x 5) (<= 5 x)), 21187#(and (<= 6 x) (<= x 6)), 21188#(and (<= 7 x) (<= x 7)), 21189#(and (<= x 8) (<= 8 x)), 21190#(and (<= 9 x) (<= x 9)), 21191#(and (<= 10 x) (<= x 10)), 21192#(and (<= x 11) (<= 11 x)), 21193#(and (<= 12 x) (<= x 12)), 21194#(and (<= 13 x) (<= x 13)), 21195#(and (<= 14 x) (<= x 14)), 21196#(and (<= x 15) (<= 15 x)), 21197#(and (<= x 16) (<= 16 x)), 21198#(and (<= x 17) (<= 17 x)), 21199#(and (<= 18 x) (<= x 18)), 21200#(and (<= x 19) (<= 19 x)), 21201#(and (<= 20 x) (<= x 20)), 21202#(and (<= x 21) (<= 21 x)), 21203#(and (<= x 22) (<= 22 x)), 21204#(and (<= 23 x) (<= x 23)), 21205#(and (<= 24 x) (<= x 24)), 21206#(and (<= x 25) (<= 25 x)), 21207#(and (<= x 26) (<= 26 x)), 21208#(and (<= 27 x) (<= x 27)), 21209#(and (<= x 28) (<= 28 x)), 21210#(and (<= x 29) (<= 29 x)), 21211#(and (<= x 30) (<= 30 x)), 21212#(and (<= 31 x) (<= x 31)), 21213#(and (<= x 32) (<= 32 x)), 21214#(and (<= x 33) (<= 33 x)), 21215#(and (<= x 34) (<= 34 x)), 21216#(and (<= 35 x) (<= x 35)), 21217#(and (<= 36 x) (<= x 36)), 21218#(and (<= 37 x) (<= x 37)), 21219#(and (<= 38 x) (<= x 38)), 21220#(and (<= x 39) (<= 39 x)), 21221#(and (<= 40 x) (<= x 40)), 21222#(and (<= 41 x) (<= x 41)), 21223#(and (<= 42 x) (<= x 42)), 21224#(and (<= x 43) (<= 43 x)), 21225#(and (<= x 44) (<= 44 x)), 21226#(and (<= 45 x) (<= x 45)), 21227#(and (<= 46 x) (<= x 46)), 21228#(and (<= x 47) (<= 47 x)), 21229#(and (<= x 48) (<= 48 x)), 21230#(and (<= 49 x) (<= x 49)), 21231#(and (<= 50 x) (<= x 50)), 21232#(and (<= x 51) (<= 51 x)), 21233#(and (<= 52 x) (<= x 52)), 21234#(and (<= x 53) (<= 53 x)), 21235#(and (<= 54 x) (<= x 54)), 21236#(and (<= x 55) (<= 55 x)), 21237#(and (<= 56 x) (<= x 56)), 21238#(and (<= 57 x) (<= x 57)), 21239#(and (<= x 58) (<= 58 x)), 21240#(and (<= x 59) (<= 59 x)), 21241#(and (<= 60 x) (<= x 60)), 21242#(and (<= 61 x) (<= x 61)), 21243#(and (<= 62 x) (<= x 62)), 21244#(and (<= 63 x) (<= x 63)), 21245#(and (<= 64 x) (<= x 64)), 21246#(and (<= 65 x) (<= x 65)), 21247#(and (<= x 66) (<= 66 x))] [2018-07-23 13:51:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:10,488 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 13:51:10,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 13:51:10,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=7314, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:51:10,489 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 88 states. [2018-07-23 13:51:11,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:11,099 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-23 13:51:11,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 13:51:11,100 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-07-23 13:51:11,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:11,101 INFO L225 Difference]: With dead ends: 96 [2018-07-23 13:51:11,101 INFO L226 Difference]: Without dead ends: 92 [2018-07-23 13:51:11,102 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=342, Invalid=7314, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:51:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-23 13:51:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-23 13:51:11,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-23 13:51:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-23 13:51:11,111 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2018-07-23 13:51:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:11,111 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-23 13:51:11,112 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 13:51:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-23 13:51:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-23 13:51:11,112 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:11,113 INFO L357 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-07-23 13:51:11,113 INFO L414 AbstractCegarLoop]: === Iteration 87 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:11,113 INFO L82 PathProgramCache]: Analyzing trace with hash 2113275936, now seen corresponding path program 86 times [2018-07-23 13:51:11,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:11,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:11,568 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 13:51:11,568 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:11,568 INFO L185 omatonBuilderFactory]: Interpolants [21643#true, 21644#false, 21645#(and (<= 0 x) (<= x 0)), 21646#(and (<= x 1) (<= 1 x)), 21647#(and (<= 2 x) (<= x 2)), 21648#(and (<= 3 x) (<= x 3)), 21649#(and (<= x 4) (<= 4 x)), 21650#(and (<= x 5) (<= 5 x)), 21651#(and (<= 6 x) (<= x 6)), 21652#(and (<= 7 x) (<= x 7)), 21653#(and (<= x 8) (<= 8 x)), 21654#(and (<= 9 x) (<= x 9)), 21655#(and (<= 10 x) (<= x 10)), 21656#(and (<= x 11) (<= 11 x)), 21657#(and (<= 12 x) (<= x 12)), 21658#(and (<= 13 x) (<= x 13)), 21659#(and (<= 14 x) (<= x 14)), 21660#(and (<= x 15) (<= 15 x)), 21661#(and (<= x 16) (<= 16 x)), 21662#(and (<= x 17) (<= 17 x)), 21663#(and (<= 18 x) (<= x 18)), 21664#(and (<= x 19) (<= 19 x)), 21665#(and (<= 20 x) (<= x 20)), 21666#(and (<= x 21) (<= 21 x)), 21667#(and (<= x 22) (<= 22 x)), 21668#(and (<= 23 x) (<= x 23)), 21669#(and (<= 24 x) (<= x 24)), 21670#(and (<= x 25) (<= 25 x)), 21671#(and (<= x 26) (<= 26 x)), 21672#(and (<= 27 x) (<= x 27)), 21673#(and (<= x 28) (<= 28 x)), 21674#(and (<= x 29) (<= 29 x)), 21675#(and (<= x 30) (<= 30 x)), 21676#(and (<= 31 x) (<= x 31)), 21677#(and (<= x 32) (<= 32 x)), 21678#(and (<= x 33) (<= 33 x)), 21679#(and (<= x 34) (<= 34 x)), 21680#(and (<= 35 x) (<= x 35)), 21681#(and (<= 36 x) (<= x 36)), 21682#(and (<= 37 x) (<= x 37)), 21683#(and (<= 38 x) (<= x 38)), 21684#(and (<= x 39) (<= 39 x)), 21685#(and (<= 40 x) (<= x 40)), 21686#(and (<= 41 x) (<= x 41)), 21687#(and (<= 42 x) (<= x 42)), 21688#(and (<= x 43) (<= 43 x)), 21689#(and (<= x 44) (<= 44 x)), 21690#(and (<= 45 x) (<= x 45)), 21691#(and (<= 46 x) (<= x 46)), 21692#(and (<= x 47) (<= 47 x)), 21693#(and (<= x 48) (<= 48 x)), 21694#(and (<= 49 x) (<= x 49)), 21695#(and (<= 50 x) (<= x 50)), 21696#(and (<= x 51) (<= 51 x)), 21697#(and (<= 52 x) (<= x 52)), 21698#(and (<= x 53) (<= 53 x)), 21699#(and (<= 54 x) (<= x 54)), 21700#(and (<= x 55) (<= 55 x)), 21701#(and (<= 56 x) (<= x 56)), 21702#(and (<= 57 x) (<= x 57)), 21703#(and (<= x 58) (<= 58 x)), 21704#(and (<= x 59) (<= 59 x)), 21705#(and (<= 60 x) (<= x 60)), 21706#(and (<= 61 x) (<= x 61)), 21707#(and (<= 62 x) (<= x 62)), 21708#(and (<= 63 x) (<= x 63)), 21709#(and (<= 64 x) (<= x 64)), 21710#(and (<= 65 x) (<= x 65)), 21711#(and (<= x 66) (<= 66 x)), 21712#(and (<= x 67) (<= 67 x)), 21713#(and (<= 68 x) (<= x 68)), 21714#(and (<= 69 x) (<= x 69)), 21715#(and (<= 70 x) (<= x 70)), 21716#(and (<= x 71) (<= 71 x)), 21717#(and (<= x 72) (<= 72 x)), 21718#(and (<= x 73) (<= 73 x)), 21719#(and (<= x 74) (<= 74 x)), 21720#(and (<= x 75) (<= 75 x)), 21721#(and (<= x 76) (<= 76 x)), 21722#(and (<= x 77) (<= 77 x)), 21723#(and (<= 78 x) (<= x 78)), 21724#(and (<= 79 x) (<= x 79)), 21725#(and (<= 80 x) (<= x 80)), 21726#(and (<= x 81) (<= 81 x)), 21727#(and (<= 82 x) (<= x 82)), 21728#(and (<= x 83) (<= 83 x)), 21729#(and (<= x 84) (<= 84 x)), 21730#(<= x 85), 21731#(<= x 86)] [2018-07-23 13:51:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:11,569 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 13:51:11,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 13:51:11,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=7486, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:51:11,570 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 89 states. [2018-07-23 13:51:12,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:12,068 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-23 13:51:12,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 13:51:12,068 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-07-23 13:51:12,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:12,069 INFO L225 Difference]: With dead ends: 97 [2018-07-23 13:51:12,069 INFO L226 Difference]: Without dead ends: 93 [2018-07-23 13:51:12,069 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=346, Invalid=7486, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:51:12,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-23 13:51:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-23 13:51:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-23 13:51:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-23 13:51:12,075 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 89 [2018-07-23 13:51:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:12,075 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-23 13:51:12,075 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 13:51:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-23 13:51:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-23 13:51:12,075 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:12,076 INFO L357 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-07-23 13:51:12,076 INFO L414 AbstractCegarLoop]: === Iteration 88 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:12,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1087052246, now seen corresponding path program 87 times [2018-07-23 13:51:12,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:12,508 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:12,508 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 13:51:12,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:12,509 INFO L185 omatonBuilderFactory]: Interpolants [22144#(and (<= x 30) (<= 30 x)), 22145#(and (<= 31 x) (<= x 31)), 22146#(and (<= x 32) (<= 32 x)), 22147#(and (<= x 33) (<= 33 x)), 22148#(and (<= x 34) (<= 34 x)), 22149#(and (<= 35 x) (<= x 35)), 22150#(and (<= 36 x) (<= x 36)), 22151#(and (<= 37 x) (<= x 37)), 22152#(and (<= 38 x) (<= x 38)), 22153#(and (<= x 39) (<= 39 x)), 22154#(and (<= 40 x) (<= x 40)), 22155#(and (<= 41 x) (<= x 41)), 22156#(and (<= 42 x) (<= x 42)), 22157#(and (<= x 43) (<= 43 x)), 22158#(and (<= x 44) (<= 44 x)), 22159#(and (<= 45 x) (<= x 45)), 22160#(and (<= 46 x) (<= x 46)), 22161#(and (<= x 47) (<= 47 x)), 22162#(and (<= x 48) (<= 48 x)), 22163#(and (<= 49 x) (<= x 49)), 22164#(and (<= 50 x) (<= x 50)), 22165#(and (<= x 51) (<= 51 x)), 22166#(and (<= 52 x) (<= x 52)), 22167#(and (<= x 53) (<= 53 x)), 22168#(and (<= 54 x) (<= x 54)), 22169#(and (<= x 55) (<= 55 x)), 22170#(and (<= 56 x) (<= x 56)), 22171#(and (<= 57 x) (<= x 57)), 22172#(and (<= x 58) (<= 58 x)), 22173#(and (<= x 59) (<= 59 x)), 22174#(and (<= 60 x) (<= x 60)), 22175#(and (<= 61 x) (<= x 61)), 22176#(and (<= 62 x) (<= x 62)), 22177#(and (<= 63 x) (<= x 63)), 22178#(and (<= 64 x) (<= x 64)), 22179#(and (<= 65 x) (<= x 65)), 22180#(and (<= x 66) (<= 66 x)), 22181#(and (<= x 67) (<= 67 x)), 22182#(and (<= 68 x) (<= x 68)), 22183#(and (<= 69 x) (<= x 69)), 22184#(and (<= 70 x) (<= x 70)), 22185#(and (<= x 71) (<= 71 x)), 22186#(and (<= x 72) (<= 72 x)), 22187#(and (<= x 73) (<= 73 x)), 22188#(and (<= x 74) (<= 74 x)), 22189#(and (<= x 75) (<= 75 x)), 22190#(and (<= x 76) (<= 76 x)), 22191#(and (<= x 77) (<= 77 x)), 22192#(and (<= 78 x) (<= x 78)), 22193#(and (<= 79 x) (<= x 79)), 22194#(and (<= 80 x) (<= x 80)), 22195#(and (<= x 81) (<= 81 x)), 22196#(and (<= 82 x) (<= x 82)), 22197#(and (<= x 83) (<= 83 x)), 22198#(and (<= x 84) (<= 84 x)), 22199#(and (<= 85 x) (<= x 85)), 22200#(<= x 86), 22201#(<= x 87), 22112#true, 22113#false, 22114#(and (<= 0 x) (<= x 0)), 22115#(and (<= x 1) (<= 1 x)), 22116#(and (<= 2 x) (<= x 2)), 22117#(and (<= 3 x) (<= x 3)), 22118#(and (<= x 4) (<= 4 x)), 22119#(and (<= x 5) (<= 5 x)), 22120#(and (<= 6 x) (<= x 6)), 22121#(and (<= 7 x) (<= x 7)), 22122#(and (<= x 8) (<= 8 x)), 22123#(and (<= 9 x) (<= x 9)), 22124#(and (<= 10 x) (<= x 10)), 22125#(and (<= x 11) (<= 11 x)), 22126#(and (<= 12 x) (<= x 12)), 22127#(and (<= 13 x) (<= x 13)), 22128#(and (<= 14 x) (<= x 14)), 22129#(and (<= x 15) (<= 15 x)), 22130#(and (<= x 16) (<= 16 x)), 22131#(and (<= x 17) (<= 17 x)), 22132#(and (<= 18 x) (<= x 18)), 22133#(and (<= x 19) (<= 19 x)), 22134#(and (<= 20 x) (<= x 20)), 22135#(and (<= x 21) (<= 21 x)), 22136#(and (<= x 22) (<= 22 x)), 22137#(and (<= 23 x) (<= x 23)), 22138#(and (<= 24 x) (<= x 24)), 22139#(and (<= x 25) (<= 25 x)), 22140#(and (<= x 26) (<= 26 x)), 22141#(and (<= 27 x) (<= x 27)), 22142#(and (<= x 28) (<= 28 x)), 22143#(and (<= x 29) (<= 29 x))] [2018-07-23 13:51:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:12,510 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 13:51:12,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 13:51:12,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=7660, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:51:12,511 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 90 states. [2018-07-23 13:51:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:13,029 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-23 13:51:13,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 13:51:13,029 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-07-23 13:51:13,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:13,030 INFO L225 Difference]: With dead ends: 98 [2018-07-23 13:51:13,030 INFO L226 Difference]: Without dead ends: 94 [2018-07-23 13:51:13,031 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=7660, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:51:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-23 13:51:13,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-23 13:51:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-23 13:51:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-23 13:51:13,036 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2018-07-23 13:51:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:13,037 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-23 13:51:13,037 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 13:51:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-23 13:51:13,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-23 13:51:13,038 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:13,038 INFO L357 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-07-23 13:51:13,038 INFO L414 AbstractCegarLoop]: === Iteration 89 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:13,038 INFO L82 PathProgramCache]: Analyzing trace with hash -661111072, now seen corresponding path program 88 times [2018-07-23 13:51:13,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:13,473 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:13,473 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 13:51:13,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:13,474 INFO L185 omatonBuilderFactory]: Interpolants [22656#(and (<= 68 x) (<= x 68)), 22657#(and (<= 69 x) (<= x 69)), 22658#(and (<= 70 x) (<= x 70)), 22659#(and (<= x 71) (<= 71 x)), 22660#(and (<= x 72) (<= 72 x)), 22661#(and (<= x 73) (<= 73 x)), 22662#(and (<= x 74) (<= 74 x)), 22663#(and (<= x 75) (<= 75 x)), 22664#(and (<= x 76) (<= 76 x)), 22665#(and (<= x 77) (<= 77 x)), 22666#(and (<= 78 x) (<= x 78)), 22667#(and (<= 79 x) (<= x 79)), 22668#(and (<= 80 x) (<= x 80)), 22669#(and (<= x 81) (<= 81 x)), 22670#(and (<= 82 x) (<= x 82)), 22671#(and (<= x 83) (<= 83 x)), 22672#(and (<= x 84) (<= 84 x)), 22673#(and (<= 85 x) (<= x 85)), 22674#(and (<= 86 x) (<= x 86)), 22675#(<= x 87), 22676#(<= x 88), 22586#true, 22587#false, 22588#(and (<= 0 x) (<= x 0)), 22589#(and (<= x 1) (<= 1 x)), 22590#(and (<= 2 x) (<= x 2)), 22591#(and (<= 3 x) (<= x 3)), 22592#(and (<= x 4) (<= 4 x)), 22593#(and (<= x 5) (<= 5 x)), 22594#(and (<= 6 x) (<= x 6)), 22595#(and (<= 7 x) (<= x 7)), 22596#(and (<= x 8) (<= 8 x)), 22597#(and (<= 9 x) (<= x 9)), 22598#(and (<= 10 x) (<= x 10)), 22599#(and (<= x 11) (<= 11 x)), 22600#(and (<= 12 x) (<= x 12)), 22601#(and (<= 13 x) (<= x 13)), 22602#(and (<= 14 x) (<= x 14)), 22603#(and (<= x 15) (<= 15 x)), 22604#(and (<= x 16) (<= 16 x)), 22605#(and (<= x 17) (<= 17 x)), 22606#(and (<= 18 x) (<= x 18)), 22607#(and (<= x 19) (<= 19 x)), 22608#(and (<= 20 x) (<= x 20)), 22609#(and (<= x 21) (<= 21 x)), 22610#(and (<= x 22) (<= 22 x)), 22611#(and (<= 23 x) (<= x 23)), 22612#(and (<= 24 x) (<= x 24)), 22613#(and (<= x 25) (<= 25 x)), 22614#(and (<= x 26) (<= 26 x)), 22615#(and (<= 27 x) (<= x 27)), 22616#(and (<= x 28) (<= 28 x)), 22617#(and (<= x 29) (<= 29 x)), 22618#(and (<= x 30) (<= 30 x)), 22619#(and (<= 31 x) (<= x 31)), 22620#(and (<= x 32) (<= 32 x)), 22621#(and (<= x 33) (<= 33 x)), 22622#(and (<= x 34) (<= 34 x)), 22623#(and (<= 35 x) (<= x 35)), 22624#(and (<= 36 x) (<= x 36)), 22625#(and (<= 37 x) (<= x 37)), 22626#(and (<= 38 x) (<= x 38)), 22627#(and (<= x 39) (<= 39 x)), 22628#(and (<= 40 x) (<= x 40)), 22629#(and (<= 41 x) (<= x 41)), 22630#(and (<= 42 x) (<= x 42)), 22631#(and (<= x 43) (<= 43 x)), 22632#(and (<= x 44) (<= 44 x)), 22633#(and (<= 45 x) (<= x 45)), 22634#(and (<= 46 x) (<= x 46)), 22635#(and (<= x 47) (<= 47 x)), 22636#(and (<= x 48) (<= 48 x)), 22637#(and (<= 49 x) (<= x 49)), 22638#(and (<= 50 x) (<= x 50)), 22639#(and (<= x 51) (<= 51 x)), 22640#(and (<= 52 x) (<= x 52)), 22641#(and (<= x 53) (<= 53 x)), 22642#(and (<= 54 x) (<= x 54)), 22643#(and (<= x 55) (<= 55 x)), 22644#(and (<= 56 x) (<= x 56)), 22645#(and (<= 57 x) (<= x 57)), 22646#(and (<= x 58) (<= 58 x)), 22647#(and (<= x 59) (<= 59 x)), 22648#(and (<= 60 x) (<= x 60)), 22649#(and (<= 61 x) (<= x 61)), 22650#(and (<= 62 x) (<= x 62)), 22651#(and (<= 63 x) (<= x 63)), 22652#(and (<= 64 x) (<= x 64)), 22653#(and (<= 65 x) (<= x 65)), 22654#(and (<= x 66) (<= 66 x)), 22655#(and (<= x 67) (<= 67 x))] [2018-07-23 13:51:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:13,474 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 13:51:13,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 13:51:13,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=7836, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:51:13,476 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 91 states. [2018-07-23 13:51:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:14,008 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-23 13:51:14,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 13:51:14,009 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-07-23 13:51:14,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:14,010 INFO L225 Difference]: With dead ends: 99 [2018-07-23 13:51:14,010 INFO L226 Difference]: Without dead ends: 95 [2018-07-23 13:51:14,010 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=354, Invalid=7836, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:51:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-23 13:51:14,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-23 13:51:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-23 13:51:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-23 13:51:14,015 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2018-07-23 13:51:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:14,016 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-23 13:51:14,016 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 13:51:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-23 13:51:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-23 13:51:14,017 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:14,017 INFO L357 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-07-23 13:51:14,017 INFO L414 AbstractCegarLoop]: === Iteration 90 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:14,017 INFO L82 PathProgramCache]: Analyzing trace with hash 980400918, now seen corresponding path program 89 times [2018-07-23 13:51:14,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:14,502 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:14,503 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 13:51:14,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:14,503 INFO L185 omatonBuilderFactory]: Interpolants [23065#true, 23066#false, 23067#(and (<= 0 x) (<= x 0)), 23068#(and (<= x 1) (<= 1 x)), 23069#(and (<= 2 x) (<= x 2)), 23070#(and (<= 3 x) (<= x 3)), 23071#(and (<= x 4) (<= 4 x)), 23072#(and (<= x 5) (<= 5 x)), 23073#(and (<= 6 x) (<= x 6)), 23074#(and (<= 7 x) (<= x 7)), 23075#(and (<= x 8) (<= 8 x)), 23076#(and (<= 9 x) (<= x 9)), 23077#(and (<= 10 x) (<= x 10)), 23078#(and (<= x 11) (<= 11 x)), 23079#(and (<= 12 x) (<= x 12)), 23080#(and (<= 13 x) (<= x 13)), 23081#(and (<= 14 x) (<= x 14)), 23082#(and (<= x 15) (<= 15 x)), 23083#(and (<= x 16) (<= 16 x)), 23084#(and (<= x 17) (<= 17 x)), 23085#(and (<= 18 x) (<= x 18)), 23086#(and (<= x 19) (<= 19 x)), 23087#(and (<= 20 x) (<= x 20)), 23088#(and (<= x 21) (<= 21 x)), 23089#(and (<= x 22) (<= 22 x)), 23090#(and (<= 23 x) (<= x 23)), 23091#(and (<= 24 x) (<= x 24)), 23092#(and (<= x 25) (<= 25 x)), 23093#(and (<= x 26) (<= 26 x)), 23094#(and (<= 27 x) (<= x 27)), 23095#(and (<= x 28) (<= 28 x)), 23096#(and (<= x 29) (<= 29 x)), 23097#(and (<= x 30) (<= 30 x)), 23098#(and (<= 31 x) (<= x 31)), 23099#(and (<= x 32) (<= 32 x)), 23100#(and (<= x 33) (<= 33 x)), 23101#(and (<= x 34) (<= 34 x)), 23102#(and (<= 35 x) (<= x 35)), 23103#(and (<= 36 x) (<= x 36)), 23104#(and (<= 37 x) (<= x 37)), 23105#(and (<= 38 x) (<= x 38)), 23106#(and (<= x 39) (<= 39 x)), 23107#(and (<= 40 x) (<= x 40)), 23108#(and (<= 41 x) (<= x 41)), 23109#(and (<= 42 x) (<= x 42)), 23110#(and (<= x 43) (<= 43 x)), 23111#(and (<= x 44) (<= 44 x)), 23112#(and (<= 45 x) (<= x 45)), 23113#(and (<= 46 x) (<= x 46)), 23114#(and (<= x 47) (<= 47 x)), 23115#(and (<= x 48) (<= 48 x)), 23116#(and (<= 49 x) (<= x 49)), 23117#(and (<= 50 x) (<= x 50)), 23118#(and (<= x 51) (<= 51 x)), 23119#(and (<= 52 x) (<= x 52)), 23120#(and (<= x 53) (<= 53 x)), 23121#(and (<= 54 x) (<= x 54)), 23122#(and (<= x 55) (<= 55 x)), 23123#(and (<= 56 x) (<= x 56)), 23124#(and (<= 57 x) (<= x 57)), 23125#(and (<= x 58) (<= 58 x)), 23126#(and (<= x 59) (<= 59 x)), 23127#(and (<= 60 x) (<= x 60)), 23128#(and (<= 61 x) (<= x 61)), 23129#(and (<= 62 x) (<= x 62)), 23130#(and (<= 63 x) (<= x 63)), 23131#(and (<= 64 x) (<= x 64)), 23132#(and (<= 65 x) (<= x 65)), 23133#(and (<= x 66) (<= 66 x)), 23134#(and (<= x 67) (<= 67 x)), 23135#(and (<= 68 x) (<= x 68)), 23136#(and (<= 69 x) (<= x 69)), 23137#(and (<= 70 x) (<= x 70)), 23138#(and (<= x 71) (<= 71 x)), 23139#(and (<= x 72) (<= 72 x)), 23140#(and (<= x 73) (<= 73 x)), 23141#(and (<= x 74) (<= 74 x)), 23142#(and (<= x 75) (<= 75 x)), 23143#(and (<= x 76) (<= 76 x)), 23144#(and (<= x 77) (<= 77 x)), 23145#(and (<= 78 x) (<= x 78)), 23146#(and (<= 79 x) (<= x 79)), 23147#(and (<= 80 x) (<= x 80)), 23148#(and (<= x 81) (<= 81 x)), 23149#(and (<= 82 x) (<= x 82)), 23150#(and (<= x 83) (<= 83 x)), 23151#(and (<= x 84) (<= 84 x)), 23152#(and (<= 85 x) (<= x 85)), 23153#(and (<= 86 x) (<= x 86)), 23154#(and (<= 87 x) (<= x 87)), 23155#(<= x 88), 23156#(<= x 89)] [2018-07-23 13:51:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:14,504 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 13:51:14,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 13:51:14,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=8014, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:51:14,505 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 92 states. [2018-07-23 13:51:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:15,029 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-23 13:51:15,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 13:51:15,029 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-07-23 13:51:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:15,030 INFO L225 Difference]: With dead ends: 100 [2018-07-23 13:51:15,030 INFO L226 Difference]: Without dead ends: 96 [2018-07-23 13:51:15,031 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=358, Invalid=8014, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:51:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-23 13:51:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-23 13:51:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-23 13:51:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-23 13:51:15,036 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 92 [2018-07-23 13:51:15,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:15,037 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-23 13:51:15,037 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 13:51:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-23 13:51:15,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-23 13:51:15,037 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:15,038 INFO L357 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-07-23 13:51:15,038 INFO L414 AbstractCegarLoop]: === Iteration 91 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:15,038 INFO L82 PathProgramCache]: Analyzing trace with hash 327665056, now seen corresponding path program 90 times [2018-07-23 13:51:15,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:15,477 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:15,477 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 13:51:15,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:15,478 INFO L185 omatonBuilderFactory]: Interpolants [23552#(and (<= x 1) (<= 1 x)), 23553#(and (<= 2 x) (<= x 2)), 23554#(and (<= 3 x) (<= x 3)), 23555#(and (<= x 4) (<= 4 x)), 23556#(and (<= x 5) (<= 5 x)), 23557#(and (<= 6 x) (<= x 6)), 23558#(and (<= 7 x) (<= x 7)), 23559#(and (<= x 8) (<= 8 x)), 23560#(and (<= 9 x) (<= x 9)), 23561#(and (<= 10 x) (<= x 10)), 23562#(and (<= x 11) (<= 11 x)), 23563#(and (<= 12 x) (<= x 12)), 23564#(and (<= 13 x) (<= x 13)), 23565#(and (<= 14 x) (<= x 14)), 23566#(and (<= x 15) (<= 15 x)), 23567#(and (<= x 16) (<= 16 x)), 23568#(and (<= x 17) (<= 17 x)), 23569#(and (<= 18 x) (<= x 18)), 23570#(and (<= x 19) (<= 19 x)), 23571#(and (<= 20 x) (<= x 20)), 23572#(and (<= x 21) (<= 21 x)), 23573#(and (<= x 22) (<= 22 x)), 23574#(and (<= 23 x) (<= x 23)), 23575#(and (<= 24 x) (<= x 24)), 23576#(and (<= x 25) (<= 25 x)), 23577#(and (<= x 26) (<= 26 x)), 23578#(and (<= 27 x) (<= x 27)), 23579#(and (<= x 28) (<= 28 x)), 23580#(and (<= x 29) (<= 29 x)), 23581#(and (<= x 30) (<= 30 x)), 23582#(and (<= 31 x) (<= x 31)), 23583#(and (<= x 32) (<= 32 x)), 23584#(and (<= x 33) (<= 33 x)), 23585#(and (<= x 34) (<= 34 x)), 23586#(and (<= 35 x) (<= x 35)), 23587#(and (<= 36 x) (<= x 36)), 23588#(and (<= 37 x) (<= x 37)), 23589#(and (<= 38 x) (<= x 38)), 23590#(and (<= x 39) (<= 39 x)), 23591#(and (<= 40 x) (<= x 40)), 23592#(and (<= 41 x) (<= x 41)), 23593#(and (<= 42 x) (<= x 42)), 23594#(and (<= x 43) (<= 43 x)), 23595#(and (<= x 44) (<= 44 x)), 23596#(and (<= 45 x) (<= x 45)), 23597#(and (<= 46 x) (<= x 46)), 23598#(and (<= x 47) (<= 47 x)), 23599#(and (<= x 48) (<= 48 x)), 23600#(and (<= 49 x) (<= x 49)), 23601#(and (<= 50 x) (<= x 50)), 23602#(and (<= x 51) (<= 51 x)), 23603#(and (<= 52 x) (<= x 52)), 23604#(and (<= x 53) (<= 53 x)), 23605#(and (<= 54 x) (<= x 54)), 23606#(and (<= x 55) (<= 55 x)), 23607#(and (<= 56 x) (<= x 56)), 23608#(and (<= 57 x) (<= x 57)), 23609#(and (<= x 58) (<= 58 x)), 23610#(and (<= x 59) (<= 59 x)), 23611#(and (<= 60 x) (<= x 60)), 23612#(and (<= 61 x) (<= x 61)), 23613#(and (<= 62 x) (<= x 62)), 23614#(and (<= 63 x) (<= x 63)), 23615#(and (<= 64 x) (<= x 64)), 23616#(and (<= 65 x) (<= x 65)), 23617#(and (<= x 66) (<= 66 x)), 23618#(and (<= x 67) (<= 67 x)), 23619#(and (<= 68 x) (<= x 68)), 23620#(and (<= 69 x) (<= x 69)), 23621#(and (<= 70 x) (<= x 70)), 23622#(and (<= x 71) (<= 71 x)), 23623#(and (<= x 72) (<= 72 x)), 23624#(and (<= x 73) (<= 73 x)), 23625#(and (<= x 74) (<= 74 x)), 23626#(and (<= x 75) (<= 75 x)), 23627#(and (<= x 76) (<= 76 x)), 23628#(and (<= x 77) (<= 77 x)), 23629#(and (<= 78 x) (<= x 78)), 23630#(and (<= 79 x) (<= x 79)), 23631#(and (<= 80 x) (<= x 80)), 23632#(and (<= x 81) (<= 81 x)), 23633#(and (<= 82 x) (<= x 82)), 23634#(and (<= x 83) (<= 83 x)), 23635#(and (<= x 84) (<= 84 x)), 23636#(and (<= 85 x) (<= x 85)), 23637#(and (<= 86 x) (<= x 86)), 23638#(and (<= 87 x) (<= x 87)), 23639#(and (<= 88 x) (<= x 88)), 23640#(<= x 89), 23641#(<= x 90), 23549#true, 23550#false, 23551#(and (<= 0 x) (<= x 0))] [2018-07-23 13:51:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:15,478 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 13:51:15,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 13:51:15,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=8194, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:51:15,479 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 93 states. [2018-07-23 13:51:16,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:16,029 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-23 13:51:16,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 13:51:16,030 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-07-23 13:51:16,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:16,030 INFO L225 Difference]: With dead ends: 101 [2018-07-23 13:51:16,030 INFO L226 Difference]: Without dead ends: 97 [2018-07-23 13:51:16,031 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=8194, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:51:16,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-23 13:51:16,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-23 13:51:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-23 13:51:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-23 13:51:16,037 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2018-07-23 13:51:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:16,038 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-23 13:51:16,038 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 13:51:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-23 13:51:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-23 13:51:16,038 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:16,039 INFO L357 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-07-23 13:51:16,039 INFO L414 AbstractCegarLoop]: === Iteration 92 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:16,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1567689814, now seen corresponding path program 91 times [2018-07-23 13:51:16,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:16,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:16,522 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:16,522 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 13:51:16,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:16,523 INFO L185 omatonBuilderFactory]: Interpolants [24064#(and (<= 24 x) (<= x 24)), 24065#(and (<= x 25) (<= 25 x)), 24066#(and (<= x 26) (<= 26 x)), 24067#(and (<= 27 x) (<= x 27)), 24068#(and (<= x 28) (<= 28 x)), 24069#(and (<= x 29) (<= 29 x)), 24070#(and (<= x 30) (<= 30 x)), 24071#(and (<= 31 x) (<= x 31)), 24072#(and (<= x 32) (<= 32 x)), 24073#(and (<= x 33) (<= 33 x)), 24074#(and (<= x 34) (<= 34 x)), 24075#(and (<= 35 x) (<= x 35)), 24076#(and (<= 36 x) (<= x 36)), 24077#(and (<= 37 x) (<= x 37)), 24078#(and (<= 38 x) (<= x 38)), 24079#(and (<= x 39) (<= 39 x)), 24080#(and (<= 40 x) (<= x 40)), 24081#(and (<= 41 x) (<= x 41)), 24082#(and (<= 42 x) (<= x 42)), 24083#(and (<= x 43) (<= 43 x)), 24084#(and (<= x 44) (<= 44 x)), 24085#(and (<= 45 x) (<= x 45)), 24086#(and (<= 46 x) (<= x 46)), 24087#(and (<= x 47) (<= 47 x)), 24088#(and (<= x 48) (<= 48 x)), 24089#(and (<= 49 x) (<= x 49)), 24090#(and (<= 50 x) (<= x 50)), 24091#(and (<= x 51) (<= 51 x)), 24092#(and (<= 52 x) (<= x 52)), 24093#(and (<= x 53) (<= 53 x)), 24094#(and (<= 54 x) (<= x 54)), 24095#(and (<= x 55) (<= 55 x)), 24096#(and (<= 56 x) (<= x 56)), 24097#(and (<= 57 x) (<= x 57)), 24098#(and (<= x 58) (<= 58 x)), 24099#(and (<= x 59) (<= 59 x)), 24100#(and (<= 60 x) (<= x 60)), 24101#(and (<= 61 x) (<= x 61)), 24102#(and (<= 62 x) (<= x 62)), 24103#(and (<= 63 x) (<= x 63)), 24104#(and (<= 64 x) (<= x 64)), 24105#(and (<= 65 x) (<= x 65)), 24106#(and (<= x 66) (<= 66 x)), 24107#(and (<= x 67) (<= 67 x)), 24108#(and (<= 68 x) (<= x 68)), 24109#(and (<= 69 x) (<= x 69)), 24110#(and (<= 70 x) (<= x 70)), 24111#(and (<= x 71) (<= 71 x)), 24112#(and (<= x 72) (<= 72 x)), 24113#(and (<= x 73) (<= 73 x)), 24114#(and (<= x 74) (<= 74 x)), 24115#(and (<= x 75) (<= 75 x)), 24116#(and (<= x 76) (<= 76 x)), 24117#(and (<= x 77) (<= 77 x)), 24118#(and (<= 78 x) (<= x 78)), 24119#(and (<= 79 x) (<= x 79)), 24120#(and (<= 80 x) (<= x 80)), 24121#(and (<= x 81) (<= 81 x)), 24122#(and (<= 82 x) (<= x 82)), 24123#(and (<= x 83) (<= 83 x)), 24124#(and (<= x 84) (<= 84 x)), 24125#(and (<= 85 x) (<= x 85)), 24126#(and (<= 86 x) (<= x 86)), 24127#(and (<= 87 x) (<= x 87)), 24128#(and (<= 88 x) (<= x 88)), 24129#(and (<= x 89) (<= 89 x)), 24130#(<= x 90), 24131#(<= x 91), 24038#true, 24039#false, 24040#(and (<= 0 x) (<= x 0)), 24041#(and (<= x 1) (<= 1 x)), 24042#(and (<= 2 x) (<= x 2)), 24043#(and (<= 3 x) (<= x 3)), 24044#(and (<= x 4) (<= 4 x)), 24045#(and (<= x 5) (<= 5 x)), 24046#(and (<= 6 x) (<= x 6)), 24047#(and (<= 7 x) (<= x 7)), 24048#(and (<= x 8) (<= 8 x)), 24049#(and (<= 9 x) (<= x 9)), 24050#(and (<= 10 x) (<= x 10)), 24051#(and (<= x 11) (<= 11 x)), 24052#(and (<= 12 x) (<= x 12)), 24053#(and (<= 13 x) (<= x 13)), 24054#(and (<= 14 x) (<= x 14)), 24055#(and (<= x 15) (<= 15 x)), 24056#(and (<= x 16) (<= 16 x)), 24057#(and (<= x 17) (<= 17 x)), 24058#(and (<= 18 x) (<= x 18)), 24059#(and (<= x 19) (<= 19 x)), 24060#(and (<= 20 x) (<= x 20)), 24061#(and (<= x 21) (<= 21 x)), 24062#(and (<= x 22) (<= 22 x)), 24063#(and (<= 23 x) (<= x 23))] [2018-07-23 13:51:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:16,523 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 13:51:16,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 13:51:16,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=8376, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:51:16,524 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 94 states. [2018-07-23 13:51:17,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:17,086 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-23 13:51:17,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 13:51:17,087 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-07-23 13:51:17,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:17,087 INFO L225 Difference]: With dead ends: 102 [2018-07-23 13:51:17,087 INFO L226 Difference]: Without dead ends: 98 [2018-07-23 13:51:17,088 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=366, Invalid=8376, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:51:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-23 13:51:17,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-23 13:51:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-23 13:51:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-23 13:51:17,094 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2018-07-23 13:51:17,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:17,094 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-23 13:51:17,094 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 13:51:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-23 13:51:17,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-23 13:51:17,095 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:17,095 INFO L357 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-07-23 13:51:17,095 INFO L414 AbstractCegarLoop]: === Iteration 93 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:17,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1353751648, now seen corresponding path program 92 times [2018-07-23 13:51:17,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:17,721 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:17,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 13:51:17,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:17,721 INFO L185 omatonBuilderFactory]: Interpolants [24576#(and (<= 42 x) (<= x 42)), 24577#(and (<= x 43) (<= 43 x)), 24578#(and (<= x 44) (<= 44 x)), 24579#(and (<= 45 x) (<= x 45)), 24580#(and (<= 46 x) (<= x 46)), 24581#(and (<= x 47) (<= 47 x)), 24582#(and (<= x 48) (<= 48 x)), 24583#(and (<= 49 x) (<= x 49)), 24584#(and (<= 50 x) (<= x 50)), 24585#(and (<= x 51) (<= 51 x)), 24586#(and (<= 52 x) (<= x 52)), 24587#(and (<= x 53) (<= 53 x)), 24588#(and (<= 54 x) (<= x 54)), 24589#(and (<= x 55) (<= 55 x)), 24590#(and (<= 56 x) (<= x 56)), 24591#(and (<= 57 x) (<= x 57)), 24592#(and (<= x 58) (<= 58 x)), 24593#(and (<= x 59) (<= 59 x)), 24594#(and (<= 60 x) (<= x 60)), 24595#(and (<= 61 x) (<= x 61)), 24596#(and (<= 62 x) (<= x 62)), 24597#(and (<= 63 x) (<= x 63)), 24598#(and (<= 64 x) (<= x 64)), 24599#(and (<= 65 x) (<= x 65)), 24600#(and (<= x 66) (<= 66 x)), 24601#(and (<= x 67) (<= 67 x)), 24602#(and (<= 68 x) (<= x 68)), 24603#(and (<= 69 x) (<= x 69)), 24604#(and (<= 70 x) (<= x 70)), 24605#(and (<= x 71) (<= 71 x)), 24606#(and (<= x 72) (<= 72 x)), 24607#(and (<= x 73) (<= 73 x)), 24608#(and (<= x 74) (<= 74 x)), 24609#(and (<= x 75) (<= 75 x)), 24610#(and (<= x 76) (<= 76 x)), 24611#(and (<= x 77) (<= 77 x)), 24612#(and (<= 78 x) (<= x 78)), 24613#(and (<= 79 x) (<= x 79)), 24614#(and (<= 80 x) (<= x 80)), 24615#(and (<= x 81) (<= 81 x)), 24616#(and (<= 82 x) (<= x 82)), 24617#(and (<= x 83) (<= 83 x)), 24618#(and (<= x 84) (<= 84 x)), 24619#(and (<= 85 x) (<= x 85)), 24620#(and (<= 86 x) (<= x 86)), 24621#(and (<= 87 x) (<= x 87)), 24622#(and (<= 88 x) (<= x 88)), 24623#(and (<= x 89) (<= 89 x)), 24624#(and (<= x 90) (<= 90 x)), 24625#(<= x 91), 24626#(<= x 92), 24532#true, 24533#false, 24534#(and (<= 0 x) (<= x 0)), 24535#(and (<= x 1) (<= 1 x)), 24536#(and (<= 2 x) (<= x 2)), 24537#(and (<= 3 x) (<= x 3)), 24538#(and (<= x 4) (<= 4 x)), 24539#(and (<= x 5) (<= 5 x)), 24540#(and (<= 6 x) (<= x 6)), 24541#(and (<= 7 x) (<= x 7)), 24542#(and (<= x 8) (<= 8 x)), 24543#(and (<= 9 x) (<= x 9)), 24544#(and (<= 10 x) (<= x 10)), 24545#(and (<= x 11) (<= 11 x)), 24546#(and (<= 12 x) (<= x 12)), 24547#(and (<= 13 x) (<= x 13)), 24548#(and (<= 14 x) (<= x 14)), 24549#(and (<= x 15) (<= 15 x)), 24550#(and (<= x 16) (<= 16 x)), 24551#(and (<= x 17) (<= 17 x)), 24552#(and (<= 18 x) (<= x 18)), 24553#(and (<= x 19) (<= 19 x)), 24554#(and (<= 20 x) (<= x 20)), 24555#(and (<= x 21) (<= 21 x)), 24556#(and (<= x 22) (<= 22 x)), 24557#(and (<= 23 x) (<= x 23)), 24558#(and (<= 24 x) (<= x 24)), 24559#(and (<= x 25) (<= 25 x)), 24560#(and (<= x 26) (<= 26 x)), 24561#(and (<= 27 x) (<= x 27)), 24562#(and (<= x 28) (<= 28 x)), 24563#(and (<= x 29) (<= 29 x)), 24564#(and (<= x 30) (<= 30 x)), 24565#(and (<= 31 x) (<= x 31)), 24566#(and (<= x 32) (<= 32 x)), 24567#(and (<= x 33) (<= 33 x)), 24568#(and (<= x 34) (<= 34 x)), 24569#(and (<= 35 x) (<= x 35)), 24570#(and (<= 36 x) (<= x 36)), 24571#(and (<= 37 x) (<= x 37)), 24572#(and (<= 38 x) (<= x 38)), 24573#(and (<= x 39) (<= 39 x)), 24574#(and (<= 40 x) (<= x 40)), 24575#(and (<= 41 x) (<= x 41))] [2018-07-23 13:51:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:17,722 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 13:51:17,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 13:51:17,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=8560, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:51:17,722 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 95 states. [2018-07-23 13:51:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:18,292 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-23 13:51:18,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 13:51:18,292 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-07-23 13:51:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:18,293 INFO L225 Difference]: With dead ends: 103 [2018-07-23 13:51:18,293 INFO L226 Difference]: Without dead ends: 99 [2018-07-23 13:51:18,294 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=370, Invalid=8560, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:51:18,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-23 13:51:18,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-23 13:51:18,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-23 13:51:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-23 13:51:18,299 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 95 [2018-07-23 13:51:18,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:18,299 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-23 13:51:18,299 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 13:51:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-23 13:51:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 13:51:18,300 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:18,300 INFO L357 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-07-23 13:51:18,300 INFO L414 AbstractCegarLoop]: === Iteration 94 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:18,300 INFO L82 PathProgramCache]: Analyzing trace with hash -983364202, now seen corresponding path program 93 times [2018-07-23 13:51:18,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:18,798 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:18,798 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 13:51:18,798 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:18,799 INFO L185 omatonBuilderFactory]: Interpolants [25088#(and (<= x 55) (<= 55 x)), 25089#(and (<= 56 x) (<= x 56)), 25090#(and (<= 57 x) (<= x 57)), 25091#(and (<= x 58) (<= 58 x)), 25092#(and (<= x 59) (<= 59 x)), 25093#(and (<= 60 x) (<= x 60)), 25094#(and (<= 61 x) (<= x 61)), 25095#(and (<= 62 x) (<= x 62)), 25096#(and (<= 63 x) (<= x 63)), 25097#(and (<= 64 x) (<= x 64)), 25098#(and (<= 65 x) (<= x 65)), 25099#(and (<= x 66) (<= 66 x)), 25100#(and (<= x 67) (<= 67 x)), 25101#(and (<= 68 x) (<= x 68)), 25102#(and (<= 69 x) (<= x 69)), 25103#(and (<= 70 x) (<= x 70)), 25104#(and (<= x 71) (<= 71 x)), 25105#(and (<= x 72) (<= 72 x)), 25106#(and (<= x 73) (<= 73 x)), 25107#(and (<= x 74) (<= 74 x)), 25108#(and (<= x 75) (<= 75 x)), 25109#(and (<= x 76) (<= 76 x)), 25110#(and (<= x 77) (<= 77 x)), 25111#(and (<= 78 x) (<= x 78)), 25112#(and (<= 79 x) (<= x 79)), 25113#(and (<= 80 x) (<= x 80)), 25114#(and (<= x 81) (<= 81 x)), 25115#(and (<= 82 x) (<= x 82)), 25116#(and (<= x 83) (<= 83 x)), 25117#(and (<= x 84) (<= 84 x)), 25118#(and (<= 85 x) (<= x 85)), 25119#(and (<= 86 x) (<= x 86)), 25120#(and (<= 87 x) (<= x 87)), 25121#(and (<= 88 x) (<= x 88)), 25122#(and (<= x 89) (<= 89 x)), 25123#(and (<= x 90) (<= 90 x)), 25124#(and (<= x 91) (<= 91 x)), 25125#(<= x 92), 25126#(<= x 93), 25031#true, 25032#false, 25033#(and (<= 0 x) (<= x 0)), 25034#(and (<= x 1) (<= 1 x)), 25035#(and (<= 2 x) (<= x 2)), 25036#(and (<= 3 x) (<= x 3)), 25037#(and (<= x 4) (<= 4 x)), 25038#(and (<= x 5) (<= 5 x)), 25039#(and (<= 6 x) (<= x 6)), 25040#(and (<= 7 x) (<= x 7)), 25041#(and (<= x 8) (<= 8 x)), 25042#(and (<= 9 x) (<= x 9)), 25043#(and (<= 10 x) (<= x 10)), 25044#(and (<= x 11) (<= 11 x)), 25045#(and (<= 12 x) (<= x 12)), 25046#(and (<= 13 x) (<= x 13)), 25047#(and (<= 14 x) (<= x 14)), 25048#(and (<= x 15) (<= 15 x)), 25049#(and (<= x 16) (<= 16 x)), 25050#(and (<= x 17) (<= 17 x)), 25051#(and (<= 18 x) (<= x 18)), 25052#(and (<= x 19) (<= 19 x)), 25053#(and (<= 20 x) (<= x 20)), 25054#(and (<= x 21) (<= 21 x)), 25055#(and (<= x 22) (<= 22 x)), 25056#(and (<= 23 x) (<= x 23)), 25057#(and (<= 24 x) (<= x 24)), 25058#(and (<= x 25) (<= 25 x)), 25059#(and (<= x 26) (<= 26 x)), 25060#(and (<= 27 x) (<= x 27)), 25061#(and (<= x 28) (<= 28 x)), 25062#(and (<= x 29) (<= 29 x)), 25063#(and (<= x 30) (<= 30 x)), 25064#(and (<= 31 x) (<= x 31)), 25065#(and (<= x 32) (<= 32 x)), 25066#(and (<= x 33) (<= 33 x)), 25067#(and (<= x 34) (<= 34 x)), 25068#(and (<= 35 x) (<= x 35)), 25069#(and (<= 36 x) (<= x 36)), 25070#(and (<= 37 x) (<= x 37)), 25071#(and (<= 38 x) (<= x 38)), 25072#(and (<= x 39) (<= 39 x)), 25073#(and (<= 40 x) (<= x 40)), 25074#(and (<= 41 x) (<= x 41)), 25075#(and (<= 42 x) (<= x 42)), 25076#(and (<= x 43) (<= 43 x)), 25077#(and (<= x 44) (<= 44 x)), 25078#(and (<= 45 x) (<= x 45)), 25079#(and (<= 46 x) (<= x 46)), 25080#(and (<= x 47) (<= 47 x)), 25081#(and (<= x 48) (<= 48 x)), 25082#(and (<= 49 x) (<= x 49)), 25083#(and (<= 50 x) (<= x 50)), 25084#(and (<= x 51) (<= 51 x)), 25085#(and (<= 52 x) (<= x 52)), 25086#(and (<= x 53) (<= 53 x)), 25087#(and (<= 54 x) (<= x 54))] [2018-07-23 13:51:18,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:18,800 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 13:51:18,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 13:51:18,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=8746, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:51:18,801 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 96 states. [2018-07-23 13:51:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:19,392 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-23 13:51:19,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 13:51:19,393 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-07-23 13:51:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:19,394 INFO L225 Difference]: With dead ends: 104 [2018-07-23 13:51:19,394 INFO L226 Difference]: Without dead ends: 100 [2018-07-23 13:51:19,395 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=374, Invalid=8746, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:51:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-23 13:51:19,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-23 13:51:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-23 13:51:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-23 13:51:19,400 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2018-07-23 13:51:19,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:19,400 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-23 13:51:19,401 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 13:51:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-23 13:51:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-23 13:51:19,401 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:19,401 INFO L357 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-07-23 13:51:19,402 INFO L414 AbstractCegarLoop]: === Iteration 95 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:19,402 INFO L82 PathProgramCache]: Analyzing trace with hash -419511520, now seen corresponding path program 94 times [2018-07-23 13:51:19,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:19,900 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:19,901 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 13:51:19,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:19,901 INFO L185 omatonBuilderFactory]: Interpolants [25600#(and (<= 63 x) (<= x 63)), 25601#(and (<= 64 x) (<= x 64)), 25602#(and (<= 65 x) (<= x 65)), 25603#(and (<= x 66) (<= 66 x)), 25604#(and (<= x 67) (<= 67 x)), 25605#(and (<= 68 x) (<= x 68)), 25606#(and (<= 69 x) (<= x 69)), 25607#(and (<= 70 x) (<= x 70)), 25608#(and (<= x 71) (<= 71 x)), 25609#(and (<= x 72) (<= 72 x)), 25610#(and (<= x 73) (<= 73 x)), 25611#(and (<= x 74) (<= 74 x)), 25612#(and (<= x 75) (<= 75 x)), 25613#(and (<= x 76) (<= 76 x)), 25614#(and (<= x 77) (<= 77 x)), 25615#(and (<= 78 x) (<= x 78)), 25616#(and (<= 79 x) (<= x 79)), 25617#(and (<= 80 x) (<= x 80)), 25618#(and (<= x 81) (<= 81 x)), 25619#(and (<= 82 x) (<= x 82)), 25620#(and (<= x 83) (<= 83 x)), 25621#(and (<= x 84) (<= 84 x)), 25622#(and (<= 85 x) (<= x 85)), 25623#(and (<= 86 x) (<= x 86)), 25624#(and (<= 87 x) (<= x 87)), 25625#(and (<= 88 x) (<= x 88)), 25626#(and (<= x 89) (<= 89 x)), 25627#(and (<= x 90) (<= 90 x)), 25628#(and (<= x 91) (<= 91 x)), 25629#(and (<= x 92) (<= 92 x)), 25630#(<= x 93), 25631#(<= x 94), 25535#true, 25536#false, 25537#(and (<= 0 x) (<= x 0)), 25538#(and (<= x 1) (<= 1 x)), 25539#(and (<= 2 x) (<= x 2)), 25540#(and (<= 3 x) (<= x 3)), 25541#(and (<= x 4) (<= 4 x)), 25542#(and (<= x 5) (<= 5 x)), 25543#(and (<= 6 x) (<= x 6)), 25544#(and (<= 7 x) (<= x 7)), 25545#(and (<= x 8) (<= 8 x)), 25546#(and (<= 9 x) (<= x 9)), 25547#(and (<= 10 x) (<= x 10)), 25548#(and (<= x 11) (<= 11 x)), 25549#(and (<= 12 x) (<= x 12)), 25550#(and (<= 13 x) (<= x 13)), 25551#(and (<= 14 x) (<= x 14)), 25552#(and (<= x 15) (<= 15 x)), 25553#(and (<= x 16) (<= 16 x)), 25554#(and (<= x 17) (<= 17 x)), 25555#(and (<= 18 x) (<= x 18)), 25556#(and (<= x 19) (<= 19 x)), 25557#(and (<= 20 x) (<= x 20)), 25558#(and (<= x 21) (<= 21 x)), 25559#(and (<= x 22) (<= 22 x)), 25560#(and (<= 23 x) (<= x 23)), 25561#(and (<= 24 x) (<= x 24)), 25562#(and (<= x 25) (<= 25 x)), 25563#(and (<= x 26) (<= 26 x)), 25564#(and (<= 27 x) (<= x 27)), 25565#(and (<= x 28) (<= 28 x)), 25566#(and (<= x 29) (<= 29 x)), 25567#(and (<= x 30) (<= 30 x)), 25568#(and (<= 31 x) (<= x 31)), 25569#(and (<= x 32) (<= 32 x)), 25570#(and (<= x 33) (<= 33 x)), 25571#(and (<= x 34) (<= 34 x)), 25572#(and (<= 35 x) (<= x 35)), 25573#(and (<= 36 x) (<= x 36)), 25574#(and (<= 37 x) (<= x 37)), 25575#(and (<= 38 x) (<= x 38)), 25576#(and (<= x 39) (<= 39 x)), 25577#(and (<= 40 x) (<= x 40)), 25578#(and (<= 41 x) (<= x 41)), 25579#(and (<= 42 x) (<= x 42)), 25580#(and (<= x 43) (<= 43 x)), 25581#(and (<= x 44) (<= 44 x)), 25582#(and (<= 45 x) (<= x 45)), 25583#(and (<= 46 x) (<= x 46)), 25584#(and (<= x 47) (<= 47 x)), 25585#(and (<= x 48) (<= 48 x)), 25586#(and (<= 49 x) (<= x 49)), 25587#(and (<= 50 x) (<= x 50)), 25588#(and (<= x 51) (<= 51 x)), 25589#(and (<= 52 x) (<= x 52)), 25590#(and (<= x 53) (<= 53 x)), 25591#(and (<= 54 x) (<= x 54)), 25592#(and (<= x 55) (<= 55 x)), 25593#(and (<= 56 x) (<= x 56)), 25594#(and (<= 57 x) (<= x 57)), 25595#(and (<= x 58) (<= 58 x)), 25596#(and (<= x 59) (<= 59 x)), 25597#(and (<= 60 x) (<= x 60)), 25598#(and (<= 61 x) (<= x 61)), 25599#(and (<= 62 x) (<= x 62))] [2018-07-23 13:51:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:19,902 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 13:51:19,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 13:51:19,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=8934, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:51:19,903 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 97 states. [2018-07-23 13:51:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:20,492 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-23 13:51:20,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 13:51:20,493 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-07-23 13:51:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:20,493 INFO L225 Difference]: With dead ends: 105 [2018-07-23 13:51:20,493 INFO L226 Difference]: Without dead ends: 101 [2018-07-23 13:51:20,494 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=8934, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:51:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-23 13:51:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-23 13:51:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-23 13:51:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-23 13:51:20,498 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2018-07-23 13:51:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:20,498 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-23 13:51:20,498 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 13:51:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-23 13:51:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-23 13:51:20,499 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:20,499 INFO L357 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-07-23 13:51:20,499 INFO L414 AbstractCegarLoop]: === Iteration 96 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:20,499 INFO L82 PathProgramCache]: Analyzing trace with hash -119947562, now seen corresponding path program 95 times [2018-07-23 13:51:20,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:21,001 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:21,001 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 13:51:21,001 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:21,002 INFO L185 omatonBuilderFactory]: Interpolants [26112#(and (<= x 66) (<= 66 x)), 26113#(and (<= x 67) (<= 67 x)), 26114#(and (<= 68 x) (<= x 68)), 26115#(and (<= 69 x) (<= x 69)), 26116#(and (<= 70 x) (<= x 70)), 26117#(and (<= x 71) (<= 71 x)), 26118#(and (<= x 72) (<= 72 x)), 26119#(and (<= x 73) (<= 73 x)), 26120#(and (<= x 74) (<= 74 x)), 26121#(and (<= x 75) (<= 75 x)), 26122#(and (<= x 76) (<= 76 x)), 26123#(and (<= x 77) (<= 77 x)), 26124#(and (<= 78 x) (<= x 78)), 26125#(and (<= 79 x) (<= x 79)), 26126#(and (<= 80 x) (<= x 80)), 26127#(and (<= x 81) (<= 81 x)), 26128#(and (<= 82 x) (<= x 82)), 26129#(and (<= x 83) (<= 83 x)), 26130#(and (<= x 84) (<= 84 x)), 26131#(and (<= 85 x) (<= x 85)), 26132#(and (<= 86 x) (<= x 86)), 26133#(and (<= 87 x) (<= x 87)), 26134#(and (<= 88 x) (<= x 88)), 26135#(and (<= x 89) (<= 89 x)), 26136#(and (<= x 90) (<= 90 x)), 26137#(and (<= x 91) (<= 91 x)), 26138#(and (<= x 92) (<= 92 x)), 26139#(and (<= 93 x) (<= x 93)), 26140#(<= x 94), 26141#(<= x 95), 26044#true, 26045#false, 26046#(and (<= 0 x) (<= x 0)), 26047#(and (<= x 1) (<= 1 x)), 26048#(and (<= 2 x) (<= x 2)), 26049#(and (<= 3 x) (<= x 3)), 26050#(and (<= x 4) (<= 4 x)), 26051#(and (<= x 5) (<= 5 x)), 26052#(and (<= 6 x) (<= x 6)), 26053#(and (<= 7 x) (<= x 7)), 26054#(and (<= x 8) (<= 8 x)), 26055#(and (<= 9 x) (<= x 9)), 26056#(and (<= 10 x) (<= x 10)), 26057#(and (<= x 11) (<= 11 x)), 26058#(and (<= 12 x) (<= x 12)), 26059#(and (<= 13 x) (<= x 13)), 26060#(and (<= 14 x) (<= x 14)), 26061#(and (<= x 15) (<= 15 x)), 26062#(and (<= x 16) (<= 16 x)), 26063#(and (<= x 17) (<= 17 x)), 26064#(and (<= 18 x) (<= x 18)), 26065#(and (<= x 19) (<= 19 x)), 26066#(and (<= 20 x) (<= x 20)), 26067#(and (<= x 21) (<= 21 x)), 26068#(and (<= x 22) (<= 22 x)), 26069#(and (<= 23 x) (<= x 23)), 26070#(and (<= 24 x) (<= x 24)), 26071#(and (<= x 25) (<= 25 x)), 26072#(and (<= x 26) (<= 26 x)), 26073#(and (<= 27 x) (<= x 27)), 26074#(and (<= x 28) (<= 28 x)), 26075#(and (<= x 29) (<= 29 x)), 26076#(and (<= x 30) (<= 30 x)), 26077#(and (<= 31 x) (<= x 31)), 26078#(and (<= x 32) (<= 32 x)), 26079#(and (<= x 33) (<= 33 x)), 26080#(and (<= x 34) (<= 34 x)), 26081#(and (<= 35 x) (<= x 35)), 26082#(and (<= 36 x) (<= x 36)), 26083#(and (<= 37 x) (<= x 37)), 26084#(and (<= 38 x) (<= x 38)), 26085#(and (<= x 39) (<= 39 x)), 26086#(and (<= 40 x) (<= x 40)), 26087#(and (<= 41 x) (<= x 41)), 26088#(and (<= 42 x) (<= x 42)), 26089#(and (<= x 43) (<= 43 x)), 26090#(and (<= x 44) (<= 44 x)), 26091#(and (<= 45 x) (<= x 45)), 26092#(and (<= 46 x) (<= x 46)), 26093#(and (<= x 47) (<= 47 x)), 26094#(and (<= x 48) (<= 48 x)), 26095#(and (<= 49 x) (<= x 49)), 26096#(and (<= 50 x) (<= x 50)), 26097#(and (<= x 51) (<= 51 x)), 26098#(and (<= 52 x) (<= x 52)), 26099#(and (<= x 53) (<= 53 x)), 26100#(and (<= 54 x) (<= x 54)), 26101#(and (<= x 55) (<= 55 x)), 26102#(and (<= 56 x) (<= x 56)), 26103#(and (<= 57 x) (<= x 57)), 26104#(and (<= x 58) (<= 58 x)), 26105#(and (<= x 59) (<= 59 x)), 26106#(and (<= 60 x) (<= x 60)), 26107#(and (<= 61 x) (<= x 61)), 26108#(and (<= 62 x) (<= x 62)), 26109#(and (<= 63 x) (<= x 63)), 26110#(and (<= 64 x) (<= x 64)), 26111#(and (<= 65 x) (<= x 65))] [2018-07-23 13:51:21,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:21,002 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 13:51:21,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 13:51:21,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=9124, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:51:21,003 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 98 states. [2018-07-23 13:51:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:21,638 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-23 13:51:21,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 13:51:21,638 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-07-23 13:51:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:21,639 INFO L225 Difference]: With dead ends: 106 [2018-07-23 13:51:21,639 INFO L226 Difference]: Without dead ends: 102 [2018-07-23 13:51:21,640 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=382, Invalid=9124, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:51:21,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-23 13:51:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-23 13:51:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-23 13:51:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-23 13:51:21,646 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 98 [2018-07-23 13:51:21,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:21,646 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-23 13:51:21,646 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 13:51:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-23 13:51:21,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-23 13:51:21,647 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:21,647 INFO L357 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-07-23 13:51:21,647 INFO L414 AbstractCegarLoop]: === Iteration 97 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:21,647 INFO L82 PathProgramCache]: Analyzing trace with hash 576600544, now seen corresponding path program 96 times [2018-07-23 13:51:21,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:22,133 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:22,133 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 13:51:22,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:22,134 INFO L185 omatonBuilderFactory]: Interpolants [26624#(and (<= 64 x) (<= x 64)), 26625#(and (<= 65 x) (<= x 65)), 26626#(and (<= x 66) (<= 66 x)), 26627#(and (<= x 67) (<= 67 x)), 26628#(and (<= 68 x) (<= x 68)), 26629#(and (<= 69 x) (<= x 69)), 26630#(and (<= 70 x) (<= x 70)), 26631#(and (<= x 71) (<= 71 x)), 26632#(and (<= x 72) (<= 72 x)), 26633#(and (<= x 73) (<= 73 x)), 26634#(and (<= x 74) (<= 74 x)), 26635#(and (<= x 75) (<= 75 x)), 26636#(and (<= x 76) (<= 76 x)), 26637#(and (<= x 77) (<= 77 x)), 26638#(and (<= 78 x) (<= x 78)), 26639#(and (<= 79 x) (<= x 79)), 26640#(and (<= 80 x) (<= x 80)), 26641#(and (<= x 81) (<= 81 x)), 26642#(and (<= 82 x) (<= x 82)), 26643#(and (<= x 83) (<= 83 x)), 26644#(and (<= x 84) (<= 84 x)), 26645#(and (<= 85 x) (<= x 85)), 26646#(and (<= 86 x) (<= x 86)), 26647#(and (<= 87 x) (<= x 87)), 26648#(and (<= 88 x) (<= x 88)), 26649#(and (<= x 89) (<= 89 x)), 26650#(and (<= x 90) (<= 90 x)), 26651#(and (<= x 91) (<= 91 x)), 26652#(and (<= x 92) (<= 92 x)), 26653#(and (<= 93 x) (<= x 93)), 26654#(and (<= x 94) (<= 94 x)), 26655#(<= x 95), 26656#(<= x 96), 26558#true, 26559#false, 26560#(and (<= 0 x) (<= x 0)), 26561#(and (<= x 1) (<= 1 x)), 26562#(and (<= 2 x) (<= x 2)), 26563#(and (<= 3 x) (<= x 3)), 26564#(and (<= x 4) (<= 4 x)), 26565#(and (<= x 5) (<= 5 x)), 26566#(and (<= 6 x) (<= x 6)), 26567#(and (<= 7 x) (<= x 7)), 26568#(and (<= x 8) (<= 8 x)), 26569#(and (<= 9 x) (<= x 9)), 26570#(and (<= 10 x) (<= x 10)), 26571#(and (<= x 11) (<= 11 x)), 26572#(and (<= 12 x) (<= x 12)), 26573#(and (<= 13 x) (<= x 13)), 26574#(and (<= 14 x) (<= x 14)), 26575#(and (<= x 15) (<= 15 x)), 26576#(and (<= x 16) (<= 16 x)), 26577#(and (<= x 17) (<= 17 x)), 26578#(and (<= 18 x) (<= x 18)), 26579#(and (<= x 19) (<= 19 x)), 26580#(and (<= 20 x) (<= x 20)), 26581#(and (<= x 21) (<= 21 x)), 26582#(and (<= x 22) (<= 22 x)), 26583#(and (<= 23 x) (<= x 23)), 26584#(and (<= 24 x) (<= x 24)), 26585#(and (<= x 25) (<= 25 x)), 26586#(and (<= x 26) (<= 26 x)), 26587#(and (<= 27 x) (<= x 27)), 26588#(and (<= x 28) (<= 28 x)), 26589#(and (<= x 29) (<= 29 x)), 26590#(and (<= x 30) (<= 30 x)), 26591#(and (<= 31 x) (<= x 31)), 26592#(and (<= x 32) (<= 32 x)), 26593#(and (<= x 33) (<= 33 x)), 26594#(and (<= x 34) (<= 34 x)), 26595#(and (<= 35 x) (<= x 35)), 26596#(and (<= 36 x) (<= x 36)), 26597#(and (<= 37 x) (<= x 37)), 26598#(and (<= 38 x) (<= x 38)), 26599#(and (<= x 39) (<= 39 x)), 26600#(and (<= 40 x) (<= x 40)), 26601#(and (<= 41 x) (<= x 41)), 26602#(and (<= 42 x) (<= x 42)), 26603#(and (<= x 43) (<= 43 x)), 26604#(and (<= x 44) (<= 44 x)), 26605#(and (<= 45 x) (<= x 45)), 26606#(and (<= 46 x) (<= x 46)), 26607#(and (<= x 47) (<= 47 x)), 26608#(and (<= x 48) (<= 48 x)), 26609#(and (<= 49 x) (<= x 49)), 26610#(and (<= 50 x) (<= x 50)), 26611#(and (<= x 51) (<= 51 x)), 26612#(and (<= 52 x) (<= x 52)), 26613#(and (<= x 53) (<= 53 x)), 26614#(and (<= 54 x) (<= x 54)), 26615#(and (<= x 55) (<= 55 x)), 26616#(and (<= 56 x) (<= x 56)), 26617#(and (<= 57 x) (<= x 57)), 26618#(and (<= x 58) (<= 58 x)), 26619#(and (<= x 59) (<= 59 x)), 26620#(and (<= 60 x) (<= x 60)), 26621#(and (<= 61 x) (<= x 61)), 26622#(and (<= 62 x) (<= x 62)), 26623#(and (<= 63 x) (<= x 63))] [2018-07-23 13:51:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:22,135 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 13:51:22,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 13:51:22,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=9316, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:51:22,135 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 99 states. [2018-07-23 13:51:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:22,749 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-23 13:51:22,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 13:51:22,749 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-07-23 13:51:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:22,750 INFO L225 Difference]: With dead ends: 107 [2018-07-23 13:51:22,750 INFO L226 Difference]: Without dead ends: 103 [2018-07-23 13:51:22,751 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=386, Invalid=9316, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:51:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-23 13:51:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-23 13:51:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-23 13:51:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-23 13:51:22,755 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2018-07-23 13:51:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:22,756 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-23 13:51:22,756 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 13:51:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-23 13:51:22,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-23 13:51:22,756 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:22,756 INFO L357 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-07-23 13:51:22,757 INFO L414 AbstractCegarLoop]: === Iteration 98 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:22,757 INFO L82 PathProgramCache]: Analyzing trace with hash 694755350, now seen corresponding path program 97 times [2018-07-23 13:51:22,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:23,275 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:23,275 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 13:51:23,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:23,276 INFO L185 omatonBuilderFactory]: Interpolants [27136#(and (<= 57 x) (<= x 57)), 27137#(and (<= x 58) (<= 58 x)), 27138#(and (<= x 59) (<= 59 x)), 27139#(and (<= 60 x) (<= x 60)), 27140#(and (<= 61 x) (<= x 61)), 27141#(and (<= 62 x) (<= x 62)), 27142#(and (<= 63 x) (<= x 63)), 27143#(and (<= 64 x) (<= x 64)), 27144#(and (<= 65 x) (<= x 65)), 27145#(and (<= x 66) (<= 66 x)), 27146#(and (<= x 67) (<= 67 x)), 27147#(and (<= 68 x) (<= x 68)), 27148#(and (<= 69 x) (<= x 69)), 27149#(and (<= 70 x) (<= x 70)), 27150#(and (<= x 71) (<= 71 x)), 27151#(and (<= x 72) (<= 72 x)), 27152#(and (<= x 73) (<= 73 x)), 27153#(and (<= x 74) (<= 74 x)), 27154#(and (<= x 75) (<= 75 x)), 27155#(and (<= x 76) (<= 76 x)), 27156#(and (<= x 77) (<= 77 x)), 27157#(and (<= 78 x) (<= x 78)), 27158#(and (<= 79 x) (<= x 79)), 27159#(and (<= 80 x) (<= x 80)), 27160#(and (<= x 81) (<= 81 x)), 27161#(and (<= 82 x) (<= x 82)), 27162#(and (<= x 83) (<= 83 x)), 27163#(and (<= x 84) (<= 84 x)), 27164#(and (<= 85 x) (<= x 85)), 27165#(and (<= 86 x) (<= x 86)), 27166#(and (<= 87 x) (<= x 87)), 27167#(and (<= 88 x) (<= x 88)), 27168#(and (<= x 89) (<= 89 x)), 27169#(and (<= x 90) (<= 90 x)), 27170#(and (<= x 91) (<= 91 x)), 27171#(and (<= x 92) (<= 92 x)), 27172#(and (<= 93 x) (<= x 93)), 27173#(and (<= x 94) (<= 94 x)), 27174#(and (<= x 95) (<= 95 x)), 27175#(<= x 96), 27176#(<= x 97), 27077#true, 27078#false, 27079#(and (<= 0 x) (<= x 0)), 27080#(and (<= x 1) (<= 1 x)), 27081#(and (<= 2 x) (<= x 2)), 27082#(and (<= 3 x) (<= x 3)), 27083#(and (<= x 4) (<= 4 x)), 27084#(and (<= x 5) (<= 5 x)), 27085#(and (<= 6 x) (<= x 6)), 27086#(and (<= 7 x) (<= x 7)), 27087#(and (<= x 8) (<= 8 x)), 27088#(and (<= 9 x) (<= x 9)), 27089#(and (<= 10 x) (<= x 10)), 27090#(and (<= x 11) (<= 11 x)), 27091#(and (<= 12 x) (<= x 12)), 27092#(and (<= 13 x) (<= x 13)), 27093#(and (<= 14 x) (<= x 14)), 27094#(and (<= x 15) (<= 15 x)), 27095#(and (<= x 16) (<= 16 x)), 27096#(and (<= x 17) (<= 17 x)), 27097#(and (<= 18 x) (<= x 18)), 27098#(and (<= x 19) (<= 19 x)), 27099#(and (<= 20 x) (<= x 20)), 27100#(and (<= x 21) (<= 21 x)), 27101#(and (<= x 22) (<= 22 x)), 27102#(and (<= 23 x) (<= x 23)), 27103#(and (<= 24 x) (<= x 24)), 27104#(and (<= x 25) (<= 25 x)), 27105#(and (<= x 26) (<= 26 x)), 27106#(and (<= 27 x) (<= x 27)), 27107#(and (<= x 28) (<= 28 x)), 27108#(and (<= x 29) (<= 29 x)), 27109#(and (<= x 30) (<= 30 x)), 27110#(and (<= 31 x) (<= x 31)), 27111#(and (<= x 32) (<= 32 x)), 27112#(and (<= x 33) (<= 33 x)), 27113#(and (<= x 34) (<= 34 x)), 27114#(and (<= 35 x) (<= x 35)), 27115#(and (<= 36 x) (<= x 36)), 27116#(and (<= 37 x) (<= x 37)), 27117#(and (<= 38 x) (<= x 38)), 27118#(and (<= x 39) (<= 39 x)), 27119#(and (<= 40 x) (<= x 40)), 27120#(and (<= 41 x) (<= x 41)), 27121#(and (<= 42 x) (<= x 42)), 27122#(and (<= x 43) (<= 43 x)), 27123#(and (<= x 44) (<= 44 x)), 27124#(and (<= 45 x) (<= x 45)), 27125#(and (<= 46 x) (<= x 46)), 27126#(and (<= x 47) (<= 47 x)), 27127#(and (<= x 48) (<= 48 x)), 27128#(and (<= 49 x) (<= x 49)), 27129#(and (<= 50 x) (<= x 50)), 27130#(and (<= x 51) (<= 51 x)), 27131#(and (<= 52 x) (<= x 52)), 27132#(and (<= x 53) (<= 53 x)), 27133#(and (<= 54 x) (<= x 54)), 27134#(and (<= x 55) (<= 55 x)), 27135#(and (<= 56 x) (<= x 56))] [2018-07-23 13:51:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:23,276 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 13:51:23,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 13:51:23,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=9510, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:51:23,277 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 100 states. [2018-07-23 13:51:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:23,915 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-07-23 13:51:23,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 13:51:23,915 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-07-23 13:51:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:23,916 INFO L225 Difference]: With dead ends: 108 [2018-07-23 13:51:23,916 INFO L226 Difference]: Without dead ends: 104 [2018-07-23 13:51:23,917 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=390, Invalid=9510, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:51:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-23 13:51:23,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-23 13:51:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-23 13:51:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-23 13:51:23,923 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2018-07-23 13:51:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:23,923 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-23 13:51:23,923 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 13:51:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-23 13:51:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-23 13:51:23,924 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:23,924 INFO L357 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-07-23 13:51:23,924 INFO L414 AbstractCegarLoop]: === Iteration 99 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:23,924 INFO L82 PathProgramCache]: Analyzing trace with hash 62587040, now seen corresponding path program 98 times [2018-07-23 13:51:23,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:24,492 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:24,492 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 13:51:24,492 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:24,493 INFO L185 omatonBuilderFactory]: Interpolants [27648#(and (<= 45 x) (<= x 45)), 27649#(and (<= 46 x) (<= x 46)), 27650#(and (<= x 47) (<= 47 x)), 27651#(and (<= x 48) (<= 48 x)), 27652#(and (<= 49 x) (<= x 49)), 27653#(and (<= 50 x) (<= x 50)), 27654#(and (<= x 51) (<= 51 x)), 27655#(and (<= 52 x) (<= x 52)), 27656#(and (<= x 53) (<= 53 x)), 27657#(and (<= 54 x) (<= x 54)), 27658#(and (<= x 55) (<= 55 x)), 27659#(and (<= 56 x) (<= x 56)), 27660#(and (<= 57 x) (<= x 57)), 27661#(and (<= x 58) (<= 58 x)), 27662#(and (<= x 59) (<= 59 x)), 27663#(and (<= 60 x) (<= x 60)), 27664#(and (<= 61 x) (<= x 61)), 27665#(and (<= 62 x) (<= x 62)), 27666#(and (<= 63 x) (<= x 63)), 27667#(and (<= 64 x) (<= x 64)), 27668#(and (<= 65 x) (<= x 65)), 27669#(and (<= x 66) (<= 66 x)), 27670#(and (<= x 67) (<= 67 x)), 27671#(and (<= 68 x) (<= x 68)), 27672#(and (<= 69 x) (<= x 69)), 27673#(and (<= 70 x) (<= x 70)), 27674#(and (<= x 71) (<= 71 x)), 27675#(and (<= x 72) (<= 72 x)), 27676#(and (<= x 73) (<= 73 x)), 27677#(and (<= x 74) (<= 74 x)), 27678#(and (<= x 75) (<= 75 x)), 27679#(and (<= x 76) (<= 76 x)), 27680#(and (<= x 77) (<= 77 x)), 27681#(and (<= 78 x) (<= x 78)), 27682#(and (<= 79 x) (<= x 79)), 27683#(and (<= 80 x) (<= x 80)), 27684#(and (<= x 81) (<= 81 x)), 27685#(and (<= 82 x) (<= x 82)), 27686#(and (<= x 83) (<= 83 x)), 27687#(and (<= x 84) (<= 84 x)), 27688#(and (<= 85 x) (<= x 85)), 27689#(and (<= 86 x) (<= x 86)), 27690#(and (<= 87 x) (<= x 87)), 27691#(and (<= 88 x) (<= x 88)), 27692#(and (<= x 89) (<= 89 x)), 27693#(and (<= x 90) (<= 90 x)), 27694#(and (<= x 91) (<= 91 x)), 27695#(and (<= x 92) (<= 92 x)), 27696#(and (<= 93 x) (<= x 93)), 27697#(and (<= x 94) (<= 94 x)), 27698#(and (<= x 95) (<= 95 x)), 27699#(and (<= x 96) (<= 96 x)), 27700#(<= x 97), 27701#(<= x 98), 27601#true, 27602#false, 27603#(and (<= 0 x) (<= x 0)), 27604#(and (<= x 1) (<= 1 x)), 27605#(and (<= 2 x) (<= x 2)), 27606#(and (<= 3 x) (<= x 3)), 27607#(and (<= x 4) (<= 4 x)), 27608#(and (<= x 5) (<= 5 x)), 27609#(and (<= 6 x) (<= x 6)), 27610#(and (<= 7 x) (<= x 7)), 27611#(and (<= x 8) (<= 8 x)), 27612#(and (<= 9 x) (<= x 9)), 27613#(and (<= 10 x) (<= x 10)), 27614#(and (<= x 11) (<= 11 x)), 27615#(and (<= 12 x) (<= x 12)), 27616#(and (<= 13 x) (<= x 13)), 27617#(and (<= 14 x) (<= x 14)), 27618#(and (<= x 15) (<= 15 x)), 27619#(and (<= x 16) (<= 16 x)), 27620#(and (<= x 17) (<= 17 x)), 27621#(and (<= 18 x) (<= x 18)), 27622#(and (<= x 19) (<= 19 x)), 27623#(and (<= 20 x) (<= x 20)), 27624#(and (<= x 21) (<= 21 x)), 27625#(and (<= x 22) (<= 22 x)), 27626#(and (<= 23 x) (<= x 23)), 27627#(and (<= 24 x) (<= x 24)), 27628#(and (<= x 25) (<= 25 x)), 27629#(and (<= x 26) (<= 26 x)), 27630#(and (<= 27 x) (<= x 27)), 27631#(and (<= x 28) (<= 28 x)), 27632#(and (<= x 29) (<= 29 x)), 27633#(and (<= x 30) (<= 30 x)), 27634#(and (<= 31 x) (<= x 31)), 27635#(and (<= x 32) (<= 32 x)), 27636#(and (<= x 33) (<= 33 x)), 27637#(and (<= x 34) (<= 34 x)), 27638#(and (<= 35 x) (<= x 35)), 27639#(and (<= 36 x) (<= x 36)), 27640#(and (<= 37 x) (<= x 37)), 27641#(and (<= 38 x) (<= x 38)), 27642#(and (<= x 39) (<= 39 x)), 27643#(and (<= 40 x) (<= x 40)), 27644#(and (<= 41 x) (<= x 41)), 27645#(and (<= 42 x) (<= x 42)), 27646#(and (<= x 43) (<= 43 x)), 27647#(and (<= x 44) (<= 44 x))] [2018-07-23 13:51:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:24,493 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 13:51:24,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 13:51:24,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=9706, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:51:24,494 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 101 states. [2018-07-23 13:51:25,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:25,331 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-23 13:51:25,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 13:51:25,331 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-07-23 13:51:25,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:25,332 INFO L225 Difference]: With dead ends: 109 [2018-07-23 13:51:25,332 INFO L226 Difference]: Without dead ends: 105 [2018-07-23 13:51:25,333 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=9706, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:51:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-23 13:51:25,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-23 13:51:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-23 13:51:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-23 13:51:25,338 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 101 [2018-07-23 13:51:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:25,338 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-23 13:51:25,338 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 13:51:25,339 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-23 13:51:25,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-23 13:51:25,339 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:25,339 INFO L357 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-07-23 13:51:25,340 INFO L414 AbstractCegarLoop]: === Iteration 100 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:25,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1940205910, now seen corresponding path program 99 times [2018-07-23 13:51:25,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:25,856 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:25,856 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 13:51:25,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:25,857 INFO L185 omatonBuilderFactory]: Interpolants [28160#(and (<= x 28) (<= 28 x)), 28161#(and (<= x 29) (<= 29 x)), 28162#(and (<= x 30) (<= 30 x)), 28163#(and (<= 31 x) (<= x 31)), 28164#(and (<= x 32) (<= 32 x)), 28165#(and (<= x 33) (<= 33 x)), 28166#(and (<= x 34) (<= 34 x)), 28167#(and (<= 35 x) (<= x 35)), 28168#(and (<= 36 x) (<= x 36)), 28169#(and (<= 37 x) (<= x 37)), 28170#(and (<= 38 x) (<= x 38)), 28171#(and (<= x 39) (<= 39 x)), 28172#(and (<= 40 x) (<= x 40)), 28173#(and (<= 41 x) (<= x 41)), 28174#(and (<= 42 x) (<= x 42)), 28175#(and (<= x 43) (<= 43 x)), 28176#(and (<= x 44) (<= 44 x)), 28177#(and (<= 45 x) (<= x 45)), 28178#(and (<= 46 x) (<= x 46)), 28179#(and (<= x 47) (<= 47 x)), 28180#(and (<= x 48) (<= 48 x)), 28181#(and (<= 49 x) (<= x 49)), 28182#(and (<= 50 x) (<= x 50)), 28183#(and (<= x 51) (<= 51 x)), 28184#(and (<= 52 x) (<= x 52)), 28185#(and (<= x 53) (<= 53 x)), 28186#(and (<= 54 x) (<= x 54)), 28187#(and (<= x 55) (<= 55 x)), 28188#(and (<= 56 x) (<= x 56)), 28189#(and (<= 57 x) (<= x 57)), 28190#(and (<= x 58) (<= 58 x)), 28191#(and (<= x 59) (<= 59 x)), 28192#(and (<= 60 x) (<= x 60)), 28193#(and (<= 61 x) (<= x 61)), 28194#(and (<= 62 x) (<= x 62)), 28195#(and (<= 63 x) (<= x 63)), 28196#(and (<= 64 x) (<= x 64)), 28197#(and (<= 65 x) (<= x 65)), 28198#(and (<= x 66) (<= 66 x)), 28199#(and (<= x 67) (<= 67 x)), 28200#(and (<= 68 x) (<= x 68)), 28201#(and (<= 69 x) (<= x 69)), 28202#(and (<= 70 x) (<= x 70)), 28203#(and (<= x 71) (<= 71 x)), 28204#(and (<= x 72) (<= 72 x)), 28205#(and (<= x 73) (<= 73 x)), 28206#(and (<= x 74) (<= 74 x)), 28207#(and (<= x 75) (<= 75 x)), 28208#(and (<= x 76) (<= 76 x)), 28209#(and (<= x 77) (<= 77 x)), 28210#(and (<= 78 x) (<= x 78)), 28211#(and (<= 79 x) (<= x 79)), 28212#(and (<= 80 x) (<= x 80)), 28213#(and (<= x 81) (<= 81 x)), 28214#(and (<= 82 x) (<= x 82)), 28215#(and (<= x 83) (<= 83 x)), 28216#(and (<= x 84) (<= 84 x)), 28217#(and (<= 85 x) (<= x 85)), 28218#(and (<= 86 x) (<= x 86)), 28219#(and (<= 87 x) (<= x 87)), 28220#(and (<= 88 x) (<= x 88)), 28221#(and (<= x 89) (<= 89 x)), 28222#(and (<= x 90) (<= 90 x)), 28223#(and (<= x 91) (<= 91 x)), 28224#(and (<= x 92) (<= 92 x)), 28225#(and (<= 93 x) (<= x 93)), 28226#(and (<= x 94) (<= 94 x)), 28227#(and (<= x 95) (<= 95 x)), 28228#(and (<= x 96) (<= 96 x)), 28229#(and (<= 97 x) (<= x 97)), 28230#(<= x 98), 28231#(<= x 99), 28130#true, 28131#false, 28132#(and (<= 0 x) (<= x 0)), 28133#(and (<= x 1) (<= 1 x)), 28134#(and (<= 2 x) (<= x 2)), 28135#(and (<= 3 x) (<= x 3)), 28136#(and (<= x 4) (<= 4 x)), 28137#(and (<= x 5) (<= 5 x)), 28138#(and (<= 6 x) (<= x 6)), 28139#(and (<= 7 x) (<= x 7)), 28140#(and (<= x 8) (<= 8 x)), 28141#(and (<= 9 x) (<= x 9)), 28142#(and (<= 10 x) (<= x 10)), 28143#(and (<= x 11) (<= 11 x)), 28144#(and (<= 12 x) (<= x 12)), 28145#(and (<= 13 x) (<= x 13)), 28146#(and (<= 14 x) (<= x 14)), 28147#(and (<= x 15) (<= 15 x)), 28148#(and (<= x 16) (<= 16 x)), 28149#(and (<= x 17) (<= 17 x)), 28150#(and (<= 18 x) (<= x 18)), 28151#(and (<= x 19) (<= 19 x)), 28152#(and (<= 20 x) (<= x 20)), 28153#(and (<= x 21) (<= 21 x)), 28154#(and (<= x 22) (<= 22 x)), 28155#(and (<= 23 x) (<= x 23)), 28156#(and (<= 24 x) (<= x 24)), 28157#(and (<= x 25) (<= 25 x)), 28158#(and (<= x 26) (<= 26 x)), 28159#(and (<= 27 x) (<= x 27))] [2018-07-23 13:51:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:25,857 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 13:51:25,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 13:51:25,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=9904, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:51:25,858 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 102 states. [2018-07-23 13:51:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:26,517 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-07-23 13:51:26,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 13:51:26,518 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-07-23 13:51:26,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:26,518 INFO L225 Difference]: With dead ends: 110 [2018-07-23 13:51:26,519 INFO L226 Difference]: Without dead ends: 106 [2018-07-23 13:51:26,519 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=398, Invalid=9904, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:51:26,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-23 13:51:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-23 13:51:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-23 13:51:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-23 13:51:26,524 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-07-23 13:51:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:26,524 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-23 13:51:26,524 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 13:51:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-23 13:51:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-23 13:51:26,525 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:26,525 INFO L357 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-07-23 13:51:26,525 INFO L414 AbstractCegarLoop]: === Iteration 101 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:26,526 INFO L82 PathProgramCache]: Analyzing trace with hash 16848736, now seen corresponding path program 100 times [2018-07-23 13:51:26,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 1225 proven. 3825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:27,311 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:27,311 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 13:51:27,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:27,312 INFO L185 omatonBuilderFactory]: Interpolants [28672#(and (<= 50 y) (<= 6 x) (<= x 6)), 28673#(and (<= 50 y) (<= 7 x) (<= x 7)), 28674#(and (<= 50 y) (<= x 8) (<= 8 x)), 28675#(and (<= 9 x) (<= x 9) (<= 50 y)), 28676#(and (<= 50 y) (<= 10 x) (<= x 10)), 28677#(and (<= 50 y) (<= x 11) (<= 11 x)), 28678#(and (<= 12 x) (<= 50 y) (<= x 12)), 28679#(and (<= 13 x) (<= 50 y) (<= x 13)), 28680#(and (<= 14 x) (<= 50 y) (<= x 14)), 28681#(and (<= 50 y) (<= x 15) (<= 15 x)), 28682#(and (<= 50 y) (<= x 16) (<= 16 x)), 28683#(and (<= 50 y) (<= x 17) (<= 17 x)), 28684#(and (<= 18 x) (<= 50 y) (<= x 18)), 28685#(and (<= 50 y) (<= x 19) (<= 19 x)), 28686#(and (<= 50 y) (<= 20 x) (<= x 20)), 28687#(and (<= x 21) (<= 50 y) (<= 21 x)), 28688#(and (<= 50 y) (<= x 22) (<= 22 x)), 28689#(and (<= 50 y) (<= 23 x) (<= x 23)), 28690#(and (<= 50 y) (<= 24 x) (<= x 24)), 28691#(and (<= 50 y) (<= x 25) (<= 25 x)), 28692#(and (<= 50 y) (<= x 26) (<= 26 x)), 28693#(and (<= 50 y) (<= 27 x) (<= x 27)), 28694#(and (<= 50 y) (<= x 28) (<= 28 x)), 28695#(and (<= 50 y) (<= x 29) (<= 29 x)), 28696#(and (<= 50 y) (<= x 30) (<= 30 x)), 28697#(and (<= 50 y) (<= 31 x) (<= x 31)), 28698#(and (<= 50 y) (<= x 32) (<= 32 x)), 28699#(and (<= 50 y) (<= x 33) (<= 33 x)), 28700#(and (<= x 34) (<= 50 y) (<= 34 x)), 28701#(and (<= 50 y) (<= 35 x) (<= x 35)), 28702#(and (<= 50 y) (<= 36 x) (<= x 36)), 28703#(and (<= 50 y) (<= 37 x) (<= x 37)), 28704#(and (<= 50 y) (<= 38 x) (<= x 38)), 28705#(and (<= x 39) (<= 50 y) (<= 39 x)), 28706#(and (<= 40 x) (<= 50 y) (<= x 40)), 28707#(and (<= 50 y) (<= 41 x) (<= x 41)), 28708#(and (<= 50 y) (<= 42 x) (<= x 42)), 28709#(and (<= x 43) (<= 50 y) (<= 43 x)), 28710#(and (<= 50 y) (<= x 44) (<= 44 x)), 28711#(and (<= 50 y) (<= 45 x) (<= x 45)), 28712#(and (<= 46 x) (<= 50 y) (<= x 46)), 28713#(and (<= x 47) (<= 50 y) (<= 47 x)), 28714#(and (<= 50 y) (<= x 48) (<= 48 x)), 28715#(and (<= 50 y) (<= 49 x) (<= x 49)), 28716#(and (<= 50 y) (<= 50 x)), 28717#(and (<= 51 x) (<= 51 y)), 28718#(and (<= 52 y) (<= 52 x)), 28719#(and (<= 53 y) (<= 53 x)), 28720#(and (<= 54 x) (<= 54 y)), 28721#(and (<= 55 x) (<= 55 y)), 28722#(and (<= 56 x) (<= 56 y)), 28723#(and (<= 57 x) (<= 57 y)), 28724#(and (<= 58 y) (<= 58 x)), 28725#(and (<= 59 y) (<= 59 x)), 28726#(and (<= 60 y) (<= 60 x)), 28727#(and (<= 61 x) (<= 61 y)), 28728#(and (<= 62 x) (<= 62 y)), 28729#(and (<= 63 y) (<= 63 x)), 28730#(and (<= 64 x) (<= 64 y)), 28731#(and (<= 65 x) (<= 65 y)), 28732#(and (<= 66 y) (<= 66 x)), 28733#(and (<= 67 y) (<= 67 x)), 28734#(and (<= 68 x) (<= 68 y)), 28735#(and (<= 69 y) (<= 69 x)), 28736#(and (<= 70 x) (<= 70 y)), 28737#(and (<= 71 x) (<= 71 y)), 28738#(and (<= 72 x) (<= 72 y)), 28739#(and (<= 73 x) (<= 73 y)), 28740#(and (<= 74 x) (<= 74 y)), 28741#(and (<= 75 x) (<= 75 y)), 28742#(and (<= 76 x) (<= 76 y)), 28743#(and (<= 77 y) (<= 77 x)), 28744#(and (<= 78 x) (<= 78 y)), 28745#(and (<= 79 y) (<= 79 x)), 28746#(and (<= 80 x) (<= 80 y)), 28747#(and (<= 81 y) (<= 81 x)), 28748#(and (<= 82 x) (<= 82 y)), 28749#(and (<= 83 x) (<= 83 y)), 28750#(and (<= 84 x) (<= 84 y)), 28751#(and (<= 85 x) (<= 85 y)), 28752#(and (<= 86 x) (<= 86 y)), 28753#(and (<= 87 x) (<= 87 y)), 28754#(and (<= 88 x) (<= 88 y)), 28755#(and (<= 89 y) (<= 89 x)), 28756#(and (<= 90 y) (<= 90 x)), 28757#(and (<= 91 y) (<= 91 x)), 28758#(and (<= 92 y) (<= 92 x)), 28759#(and (<= 93 x) (<= 93 y)), 28760#(and (<= 94 y) (<= 94 x)), 28761#(and (<= 95 x) (<= 95 y)), 28762#(and (<= 96 y) (<= 96 x)), 28763#(and (<= 97 y) (<= 97 x)), 28764#(and (<= 98 y) (<= 98 x)), 28765#(and (<= 99 x) (<= 99 y)), 28766#(<= 100 y), 28664#true, 28665#false, 28666#(and (<= 50 y) (<= 0 x) (<= x 0)), 28667#(and (<= x 1) (<= 50 y) (<= 1 x)), 28668#(and (<= 2 x) (<= 50 y) (<= x 2)), 28669#(and (<= 3 x) (<= 50 y) (<= x 3)), 28670#(and (<= x 4) (<= 50 y) (<= 4 x)), 28671#(and (<= x 5) (<= 50 y) (<= 5 x))] [2018-07-23 13:51:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 1225 proven. 3825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:27,313 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 13:51:27,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 13:51:27,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1428, Invalid=9078, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:51:27,314 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 103 states. [2018-07-23 13:51:28,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:28,511 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-23 13:51:28,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 13:51:28,511 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-07-23 13:51:28,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:28,513 INFO L225 Difference]: With dead ends: 106 [2018-07-23 13:51:28,513 INFO L226 Difference]: Without dead ends: 105 [2018-07-23 13:51:28,514 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1481, Invalid=9231, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 13:51:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-23 13:51:28,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-23 13:51:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-23 13:51:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-23 13:51:28,523 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-07-23 13:51:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:28,524 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-23 13:51:28,524 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 13:51:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-23 13:51:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-23 13:51:28,525 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:28,525 INFO L357 BasicCegarLoop]: trace histogram [100, 1, 1, 1, 1] [2018-07-23 13:51:28,525 INFO L414 AbstractCegarLoop]: === Iteration 102 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:28,525 INFO L82 PathProgramCache]: Analyzing trace with hash 522310862, now seen corresponding path program 1 times [2018-07-23 13:51:28,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:29,652 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:29,652 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 13:51:29,652 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:29,653 INFO L185 omatonBuilderFactory]: Interpolants [29191#true, 29192#false, 29193#(and (<= y 50) (<= 0 x) (<= x 0)), 29194#(and (<= y 50) (<= x 1) (<= 1 x)), 29195#(and (<= 2 x) (<= y 50) (<= x 2)), 29196#(and (<= y 50) (<= 3 x) (<= x 3)), 29197#(and (<= x 4) (<= y 50) (<= 4 x)), 29198#(and (<= y 50) (<= x 5) (<= 5 x)), 29199#(and (<= y 50) (<= 6 x) (<= x 6)), 29200#(and (<= y 50) (<= 7 x) (<= x 7)), 29201#(and (<= y 50) (<= x 8) (<= 8 x)), 29202#(and (<= 9 x) (<= y 50) (<= x 9)), 29203#(and (<= y 50) (<= 10 x) (<= x 10)), 29204#(and (<= y 50) (<= x 11) (<= 11 x)), 29205#(and (<= 12 x) (<= y 50) (<= x 12)), 29206#(and (<= y 50) (<= 13 x) (<= x 13)), 29207#(and (<= 14 x) (<= y 50) (<= x 14)), 29208#(and (<= y 50) (<= x 15) (<= 15 x)), 29209#(and (<= y 50) (<= x 16) (<= 16 x)), 29210#(and (<= y 50) (<= x 17) (<= 17 x)), 29211#(and (<= y 50) (<= 18 x) (<= x 18)), 29212#(and (<= y 50) (<= x 19) (<= 19 x)), 29213#(and (<= y 50) (<= 20 x) (<= x 20)), 29214#(and (<= y 50) (<= x 21) (<= 21 x)), 29215#(and (<= y 50) (<= x 22) (<= 22 x)), 29216#(and (<= y 50) (<= 23 x) (<= x 23)), 29217#(and (<= y 50) (<= 24 x) (<= x 24)), 29218#(and (<= y 50) (<= x 25) (<= 25 x)), 29219#(and (<= y 50) (<= x 26) (<= 26 x)), 29220#(and (<= y 50) (<= 27 x) (<= x 27)), 29221#(and (<= y 50) (<= x 28) (<= 28 x)), 29222#(and (<= y 50) (<= x 29) (<= 29 x)), 29223#(and (<= y 50) (<= x 30) (<= 30 x)), 29224#(and (<= y 50) (<= 31 x) (<= x 31)), 29225#(and (<= y 50) (<= x 32) (<= 32 x)), 29226#(and (<= y 50) (<= x 33) (<= 33 x)), 29227#(and (<= y 50) (<= x 34) (<= 34 x)), 29228#(and (<= y 50) (<= 35 x) (<= x 35)), 29229#(and (<= y 50) (<= 36 x) (<= x 36)), 29230#(and (<= y 50) (<= 37 x) (<= x 37)), 29231#(and (<= y 50) (<= 38 x) (<= x 38)), 29232#(and (<= x 39) (<= y 50) (<= 39 x)), 29233#(and (<= y 50) (<= 40 x) (<= x 40)), 29234#(and (<= y 50) (<= 41 x) (<= x 41)), 29235#(and (<= y 50) (<= 42 x) (<= x 42)), 29236#(and (<= y 50) (<= x 43) (<= 43 x)), 29237#(and (<= y 50) (<= x 44) (<= 44 x)), 29238#(and (<= y 50) (<= 45 x) (<= x 45)), 29239#(and (<= y 50) (<= 46 x) (<= x 46)), 29240#(and (<= x 47) (<= y 50) (<= 47 x)), 29241#(and (<= y 50) (<= x 48) (<= 48 x)), 29242#(and (<= y 50) (<= 49 x) (<= x 49)), 29243#(and (<= y 50) (<= 50 x)), 29244#(and (<= 51 x) (<= y 51)), 29245#(and (<= 52 x) (<= y 52)), 29246#(and (<= 53 x) (<= y 53)), 29247#(and (<= 54 x) (<= y 54)), 29248#(and (<= y 55) (<= 55 x)), 29249#(and (<= 56 x) (<= y 56)), 29250#(and (<= 57 x) (<= y 57)), 29251#(and (<= y 58) (<= 58 x)), 29252#(and (<= y 59) (<= 59 x)), 29253#(and (<= 60 x) (<= y 60)), 29254#(and (<= 61 x) (<= y 61)), 29255#(and (<= 62 x) (<= y 62)), 29256#(and (<= 63 x) (<= y 63)), 29257#(and (<= 64 x) (<= y 64)), 29258#(and (<= y 65) (<= 65 x)), 29259#(and (<= y 66) (<= 66 x)), 29260#(and (<= y 67) (<= 67 x)), 29261#(and (<= 68 x) (<= y 68)), 29262#(and (<= y 69) (<= 69 x)), 29263#(and (<= 70 x) (<= y 70)), 29264#(and (<= 71 x) (<= y 71)), 29265#(and (<= y 72) (<= 72 x)), 29266#(and (<= 73 x) (<= y 73)), 29267#(and (<= 74 x) (<= y 74)), 29268#(and (<= 75 x) (<= y 75)), 29269#(and (<= y 76) (<= 76 x)), 29270#(and (<= y 77) (<= 77 x)), 29271#(and (<= y 78) (<= 78 x)), 29272#(and (<= y 79) (<= 79 x)), 29273#(and (<= 80 x) (<= y 80)), 29274#(and (<= y 81) (<= 81 x)), 29275#(and (<= 82 x) (<= y 82)), 29276#(and (<= y 83) (<= 83 x)), 29277#(and (<= 84 x) (<= y 84)), 29278#(and (<= 85 x) (<= y 85)), 29279#(and (<= 86 x) (<= y 86)), 29280#(and (<= 87 x) (<= y 87)), 29281#(and (<= 88 x) (<= y 88)), 29282#(and (<= y 89) (<= 89 x)), 29283#(and (<= y 90) (<= 90 x)), 29284#(and (<= y 91) (<= 91 x)), 29285#(and (<= 92 x) (<= y 92)), 29286#(and (<= 93 x) (<= y 93)), 29287#(and (<= y 94) (<= 94 x)), 29288#(and (<= 95 x) (<= y 95)), 29289#(and (<= y 96) (<= 96 x)), 29290#(and (<= 97 x) (<= y 97)), 29291#(and (<= y 98) (<= 98 x)), 29292#(<= y 99), 29293#(<= y 100)] [2018-07-23 13:51:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:29,654 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 13:51:29,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 13:51:29,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=10104, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:51:29,656 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 103 states. [2018-07-23 13:51:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:31,575 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-23 13:51:31,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 13:51:31,575 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 104 [2018-07-23 13:51:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:31,576 INFO L225 Difference]: With dead ends: 109 [2018-07-23 13:51:31,576 INFO L226 Difference]: Without dead ends: 106 [2018-07-23 13:51:31,577 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=402, Invalid=10104, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:51:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-23 13:51:31,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-23 13:51:31,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-23 13:51:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-23 13:51:31,586 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-07-23 13:51:31,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:31,586 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-23 13:51:31,586 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 13:51:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-23 13:51:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-23 13:51:31,587 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:31,587 INFO L357 BasicCegarLoop]: trace histogram [101, 1, 1, 1, 1] [2018-07-23 13:51:31,587 INFO L414 AbstractCegarLoop]: === Iteration 103 === [mainErr0AssertViolationASSERT, mainErr1AssertViolationASSERT]=== [2018-07-23 13:51:31,588 INFO L82 PathProgramCache]: Analyzing trace with hash -987996072, now seen corresponding path program 2 times [2018-07-23 13:51:31,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 1376 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:32,260 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:32,260 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-23 13:51:32,260 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:32,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:32,261 INFO L185 omatonBuilderFactory]: Interpolants [29724#true, 29725#false, 29726#(and (<= 0 x) (<= x 0)), 29727#(and (<= x 1) (<= 1 x)), 29728#(and (<= 2 x) (<= x 2)), 29729#(and (<= 3 x) (<= x 3)), 29730#(and (<= x 4) (<= 4 x)), 29731#(and (<= x 5) (<= 5 x)), 29732#(and (<= 6 x) (<= x 6)), 29733#(and (<= 7 x) (<= x 7)), 29734#(and (<= x 8) (<= 8 x)), 29735#(and (<= 9 x) (<= x 9)), 29736#(and (<= 10 x) (<= x 10)), 29737#(and (<= x 11) (<= 11 x)), 29738#(and (<= 12 x) (<= x 12)), 29739#(and (<= 13 x) (<= x 13)), 29740#(and (<= 14 x) (<= x 14)), 29741#(and (<= x 15) (<= 15 x)), 29742#(and (<= x 16) (<= 16 x)), 29743#(and (<= x 17) (<= 17 x)), 29744#(and (<= 18 x) (<= x 18)), 29745#(and (<= x 19) (<= 19 x)), 29746#(and (<= 20 x) (<= x 20)), 29747#(and (<= x 21) (<= 21 x)), 29748#(and (<= x 22) (<= 22 x)), 29749#(and (<= 23 x) (<= x 23)), 29750#(and (<= 24 x) (<= x 24)), 29751#(and (<= x 25) (<= 25 x)), 29752#(and (<= x 26) (<= 26 x)), 29753#(and (<= 27 x) (<= x 27)), 29754#(and (<= x 28) (<= 28 x)), 29755#(and (<= x 29) (<= 29 x)), 29756#(and (<= x 30) (<= 30 x)), 29757#(and (<= 31 x) (<= x 31)), 29758#(and (<= x 32) (<= 32 x)), 29759#(and (<= x 33) (<= 33 x)), 29760#(and (<= x 34) (<= 34 x)), 29761#(and (<= 35 x) (<= x 35)), 29762#(and (<= 36 x) (<= x 36)), 29763#(and (<= 37 x) (<= x 37)), 29764#(and (<= 38 x) (<= x 38)), 29765#(and (<= x 39) (<= 39 x)), 29766#(and (<= 40 x) (<= x 40)), 29767#(and (<= 41 x) (<= x 41)), 29768#(and (<= 42 x) (<= x 42)), 29769#(and (<= x 43) (<= 43 x)), 29770#(and (<= x 44) (<= 44 x)), 29771#(and (<= 45 x) (<= x 45)), 29772#(and (<= 46 x) (<= x 46)), 29773#(and (<= x 47) (<= 47 x)), 29774#(and (<= x 48) (<= 48 x)), 29775#(and (<= 49 x) (<= x 49)), 29776#(<= 50 x), 29777#(<= 51 x), 29778#(<= 52 x), 29779#(<= 53 x), 29780#(<= 54 x), 29781#(<= 55 x), 29782#(<= 56 x), 29783#(<= 57 x), 29784#(<= 58 x), 29785#(<= 59 x), 29786#(<= 60 x), 29787#(<= 61 x), 29788#(<= 62 x), 29789#(<= 63 x), 29790#(<= 64 x), 29791#(<= 65 x), 29792#(<= 66 x), 29793#(<= 67 x), 29794#(<= 68 x), 29795#(<= 69 x), 29796#(<= 70 x), 29797#(<= 71 x), 29798#(<= 72 x), 29799#(<= 73 x), 29800#(<= 74 x), 29801#(<= 75 x), 29802#(<= 76 x), 29803#(<= 77 x), 29804#(<= 78 x), 29805#(<= 79 x), 29806#(<= 80 x), 29807#(<= 81 x), 29808#(<= 82 x), 29809#(<= 83 x), 29810#(<= 84 x), 29811#(<= 85 x), 29812#(<= 86 x), 29813#(<= 87 x), 29814#(<= 88 x), 29815#(<= 89 x), 29816#(<= 90 x), 29817#(<= 91 x), 29818#(<= 92 x), 29819#(<= 93 x), 29820#(<= 94 x), 29821#(<= 95 x), 29822#(<= 96 x), 29823#(<= 97 x), 29824#(<= 98 x), 29825#(<= 99 x), 29826#(<= 100 x)] [2018-07-23 13:51:32,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 1376 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:32,262 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 13:51:32,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 13:51:32,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1478, Invalid=9028, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:51:32,263 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 103 states. [2018-07-23 13:51:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:32,886 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-23 13:51:32,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 13:51:32,886 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 105 [2018-07-23 13:51:32,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:32,887 INFO L225 Difference]: With dead ends: 106 [2018-07-23 13:51:32,887 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:51:32,888 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1478, Invalid=9028, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:51:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:51:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:51:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:51:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:51:32,889 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2018-07-23 13:51:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:32,889 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:51:32,889 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 13:51:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:51:32,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:51:32,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:51:33,077 WARN L169 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 508 [2018-07-23 13:51:34,215 WARN L169 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 508 DAG size of output: 508 [2018-07-23 13:51:34,225 INFO L417 ceAbstractionStarter]: At program point mainErr0AssertViolationASSERT(line 24) the Hoare annotation is: false [2018-07-23 13:51:34,225 INFO L421 ceAbstractionStarter]: For program point mainFINAL(lines 11 26) no Hoare annotation was computed. [2018-07-23 13:51:34,225 INFO L417 ceAbstractionStarter]: At program point mainErr1AssertViolationASSERT(line 25) the Hoare annotation is: false [2018-07-23 13:51:34,226 INFO L417 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (and (<= 99 x) (<= 100 y) (<= y 100)) [2018-07-23 13:51:34,226 INFO L417 ceAbstractionStarter]: At program point L24(line 24) the Hoare annotation is: (and (<= 99 x) (<= 100 y) (<= y 100)) [2018-07-23 13:51:34,226 INFO L424 ceAbstractionStarter]: At program point mainEXIT(lines 11 26) the Hoare annotation is: true [2018-07-23 13:51:34,226 INFO L424 ceAbstractionStarter]: At program point mainENTRY(lines 11 26) the Hoare annotation is: true [2018-07-23 13:51:34,226 INFO L421 ceAbstractionStarter]: For program point L16(lines 16 21) no Hoare annotation was computed. [2018-07-23 13:51:34,234 INFO L417 ceAbstractionStarter]: At program point L16''(lines 15 22) the Hoare annotation is: (let ((.cse0 (<= y 50)) (.cse1 (<= 50 y))) (or (and (<= 54 x) (<= x 54) (<= 54 y) (<= y 54)) (and .cse0 .cse1 (<= x 17) (<= 17 x)) (and .cse0 (<= x 43) .cse1 (<= 43 x)) (and (<= 14 x) .cse0 .cse1 (<= x 14)) (and .cse0 .cse1 (<= 20 x) (<= x 20)) (and .cse0 (<= 3 x) .cse1 (<= x 3)) (and .cse0 .cse1 (<= x 28) (<= 28 x)) (and (<= 93 x) (<= x 93) (<= 93 y) (<= y 93)) (and (<= x 72) (<= y 72) (<= 72 x) (<= 72 y)) (and (<= x 75) (<= 75 x) (<= y 75) (<= 75 y)) (and (<= x 84) (<= 84 x) (<= 84 y) (<= y 84)) (and (<= 63 y) (<= 63 x) (<= y 63) (<= x 63)) (and (<= 99 x) (<= 99 y) (<= y 99) (<= x 99)) (and (<= 80 x) (<= y 80) (<= x 80) (<= 80 y)) (and (<= x 71) (<= 71 x) (<= 71 y) (<= y 71)) (and .cse0 .cse1 (<= 50 x) (<= x 50)) (and (<= y 78) (<= 78 x) (<= 78 y) (<= x 78)) (and .cse0 .cse1 (<= 0 x) (<= x 0)) (and (<= 62 x) (<= y 62) (<= 62 y) (<= x 62)) (and .cse0 .cse1 (<= 10 x) (<= x 10)) (and (<= 12 x) .cse0 .cse1 (<= x 12)) (and .cse0 .cse1 (<= x 32) (<= 32 x)) (and .cse0 .cse1 (<= 31 x) (<= x 31)) (and (<= 68 x) (<= 68 y) (<= x 68) (<= y 68)) (and (<= 87 x) (<= y 87) (<= 87 y) (<= x 87)) (and .cse0 .cse1 (<= x 19) (<= 19 x)) (and .cse0 .cse1 (<= 42 x) (<= x 42)) (and (<= y 65) (<= 65 x) (<= 65 y) (<= x 65)) (and (<= 2 x) .cse0 .cse1 (<= x 2)) (and .cse0 .cse1 (<= x 25) (<= 25 x)) (and .cse0 .cse1 (<= x 22) (<= 22 x)) (and .cse0 .cse1 (<= x 26) (<= 26 x)) (and .cse0 .cse1 (<= x 8) (<= 8 x)) (and .cse0 (<= 18 x) .cse1 (<= x 18)) (and (<= y 76) (<= x 76) (<= 76 x) (<= 76 y)) (and .cse0 .cse1 (<= 27 x) (<= x 27)) (and (<= 9 x) .cse0 (<= x 9) .cse1) (and (<= x 51) (<= 51 x) (<= y 51) (<= 51 y)) (and (<= 69 y) (<= y 69) (<= 69 x) (<= x 69)) (and (<= 58 y) (<= y 58) (<= x 58) (<= 58 x)) (and (<= x 4) .cse0 .cse1 (<= 4 x)) (and .cse0 (<= x 1) .cse1 (<= 1 x)) (and .cse0 .cse1 (<= 36 x) (<= x 36)) (and .cse0 (<= 46 x) .cse1 (<= x 46)) (and (<= 52 y) (<= 52 x) (<= y 52) (<= x 52)) (and .cse0 .cse1 (<= x 48) (<= 48 x)) (and .cse0 .cse1 (<= x 15) (<= 15 x)) (and (<= 96 y) (<= x 96) (<= y 96) (<= 96 x)) (and (<= y 91) (<= 91 y) (<= x 91) (<= 91 x)) (and (<= x 98) (<= y 98) (<= 98 y) (<= 98 x)) (and (<= x 95) (<= 95 x) (<= y 95) (<= 95 y)) (and (<= 88 x) (<= x 88) (<= y 88) (<= 88 y)) (and (<= x 39) .cse0 .cse1 (<= 39 x)) (and (<= x 73) (<= 73 x) (<= y 73) (<= 73 y)) (and (<= x 66) (<= 66 y) (<= y 66) (<= 66 x)) (and (<= 77 y) (<= y 77) (<= x 77) (<= 77 x)) (and .cse0 .cse1 (<= 35 x) (<= x 35)) (and (<= 97 y) (<= 97 x) (<= x 97) (<= y 97)) (and .cse0 (<= x 5) .cse1 (<= 5 x)) (and (<= x 59) (<= 59 y) (<= y 59) (<= 59 x)) (and (<= 85 x) (<= y 85) (<= 85 y) (<= x 85)) (and (<= 53 y) (<= x 53) (<= 53 x) (<= y 53)) (and (<= 60 y) (<= 60 x) (<= x 60) (<= y 60)) (and .cse0 .cse1 (<= 38 x) (<= x 38)) (and .cse0 (<= x 21) .cse1 (<= 21 x)) (and .cse0 .cse1 (<= 23 x) (<= x 23)) (and .cse0 .cse1 (<= x 33) (<= 33 x)) (and (<= 70 x) (<= 70 y) (<= x 70) (<= y 70)) (and (<= 64 x) (<= y 64) (<= 64 y) (<= x 64)) (and (<= y 55) (<= x 55) (<= 55 x) (<= 55 y)) (and (<= y 81) (<= x 81) (<= 81 y) (<= 81 x)) (and .cse0 .cse1 (<= 49 x) (<= x 49)) (and .cse0 .cse1 (<= x 11) (<= 11 x)) (and .cse0 .cse1 (<= x 16) (<= 16 x)) (and (<= 92 y) (<= x 92) (<= 92 x) (<= y 92)) (and (<= x 74) (<= 74 x) (<= y 74) (<= 74 y)) (and .cse0 .cse1 (<= 7 x) (<= x 7)) (and (<= y 79) (<= 79 y) (<= 79 x) (<= x 79)) (and .cse0 (<= x 34) .cse1 (<= 34 x)) (and (<= x 47) .cse0 .cse1 (<= 47 x)) (and (<= x 94) (<= 94 y) (<= y 94) (<= 94 x)) (and (<= 67 y) (<= y 67) (<= x 67) (<= 67 x)) (and (<= 56 x) (<= y 56) (<= x 56) (<= 56 y)) (and (<= 61 x) (<= y 61) (<= 61 y) (<= x 61)) (and .cse0 .cse1 (<= x 44) (<= 44 x)) (and .cse0 (<= 40 x) .cse1 (<= x 40)) (and .cse0 .cse1 (<= 45 x) (<= x 45)) (and (<= x 83) (<= y 83) (<= 83 x) (<= 83 y)) (and (<= x 89) (<= 89 y) (<= y 89) (<= 89 x)) (and (<= 100 x) (<= 100 y) (<= y 100)) (and (<= 57 x) (<= x 57) (<= y 57) (<= 57 y)) (and .cse0 .cse1 (<= 24 x) (<= x 24)) (and .cse0 (<= 13 x) .cse1 (<= x 13)) (and (<= 86 x) (<= 86 y) (<= y 86) (<= x 86)) (and .cse0 .cse1 (<= x 30) (<= 30 x)) (and .cse0 .cse1 (<= 6 x) (<= x 6)) (and .cse0 .cse1 (<= x 29) (<= 29 x)) (and .cse0 .cse1 (<= 37 x) (<= x 37)) (and (<= y 90) (<= x 90) (<= 90 y) (<= 90 x)) (and (<= 82 x) (<= y 82) (<= x 82) (<= 82 y)) (and .cse0 .cse1 (<= 41 x) (<= x 41)))) [2018-07-23 13:51:34,269 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:51:34 BoogieIcfgContainer [2018-07-23 13:51:34,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:51:34,270 INFO L168 Benchmark]: Toolchain (without parser) took 66211.73 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -361.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-07-23 13:51:34,271 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:51:34,272 INFO L168 Benchmark]: Boogie Preprocessor took 45.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:51:34,272 INFO L168 Benchmark]: RCFGBuilder took 252.11 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:51:34,273 INFO L168 Benchmark]: TraceAbstraction took 65910.47 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -371.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-07-23 13:51:34,275 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 252.11 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 65910.47 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -371.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 24]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((54 <= x && x <= 54) && 54 <= y) && y <= 54) || (((y <= 50 && 50 <= y) && x <= 17) && 17 <= x)) || (((y <= 50 && x <= 43) && 50 <= y) && 43 <= x)) || (((14 <= x && y <= 50) && 50 <= y) && x <= 14)) || (((y <= 50 && 50 <= y) && 20 <= x) && x <= 20)) || (((y <= 50 && 3 <= x) && 50 <= y) && x <= 3)) || (((y <= 50 && 50 <= y) && x <= 28) && 28 <= x)) || (((93 <= x && x <= 93) && 93 <= y) && y <= 93)) || (((x <= 72 && y <= 72) && 72 <= x) && 72 <= y)) || (((x <= 75 && 75 <= x) && y <= 75) && 75 <= y)) || (((x <= 84 && 84 <= x) && 84 <= y) && y <= 84)) || (((63 <= y && 63 <= x) && y <= 63) && x <= 63)) || (((99 <= x && 99 <= y) && y <= 99) && x <= 99)) || (((80 <= x && y <= 80) && x <= 80) && 80 <= y)) || (((x <= 71 && 71 <= x) && 71 <= y) && y <= 71)) || (((y <= 50 && 50 <= y) && 50 <= x) && x <= 50)) || (((y <= 78 && 78 <= x) && 78 <= y) && x <= 78)) || (((y <= 50 && 50 <= y) && 0 <= x) && x <= 0)) || (((62 <= x && y <= 62) && 62 <= y) && x <= 62)) || (((y <= 50 && 50 <= y) && 10 <= x) && x <= 10)) || (((12 <= x && y <= 50) && 50 <= y) && x <= 12)) || (((y <= 50 && 50 <= y) && x <= 32) && 32 <= x)) || (((y <= 50 && 50 <= y) && 31 <= x) && x <= 31)) || (((68 <= x && 68 <= y) && x <= 68) && y <= 68)) || (((87 <= x && y <= 87) && 87 <= y) && x <= 87)) || (((y <= 50 && 50 <= y) && x <= 19) && 19 <= x)) || (((y <= 50 && 50 <= y) && 42 <= x) && x <= 42)) || (((y <= 65 && 65 <= x) && 65 <= y) && x <= 65)) || (((2 <= x && y <= 50) && 50 <= y) && x <= 2)) || (((y <= 50 && 50 <= y) && x <= 25) && 25 <= x)) || (((y <= 50 && 50 <= y) && x <= 22) && 22 <= x)) || (((y <= 50 && 50 <= y) && x <= 26) && 26 <= x)) || (((y <= 50 && 50 <= y) && x <= 8) && 8 <= x)) || (((y <= 50 && 18 <= x) && 50 <= y) && x <= 18)) || (((y <= 76 && x <= 76) && 76 <= x) && 76 <= y)) || (((y <= 50 && 50 <= y) && 27 <= x) && x <= 27)) || (((9 <= x && y <= 50) && x <= 9) && 50 <= y)) || (((x <= 51 && 51 <= x) && y <= 51) && 51 <= y)) || (((69 <= y && y <= 69) && 69 <= x) && x <= 69)) || (((58 <= y && y <= 58) && x <= 58) && 58 <= x)) || (((x <= 4 && y <= 50) && 50 <= y) && 4 <= x)) || (((y <= 50 && x <= 1) && 50 <= y) && 1 <= x)) || (((y <= 50 && 50 <= y) && 36 <= x) && x <= 36)) || (((y <= 50 && 46 <= x) && 50 <= y) && x <= 46)) || (((52 <= y && 52 <= x) && y <= 52) && x <= 52)) || (((y <= 50 && 50 <= y) && x <= 48) && 48 <= x)) || (((y <= 50 && 50 <= y) && x <= 15) && 15 <= x)) || (((96 <= y && x <= 96) && y <= 96) && 96 <= x)) || (((y <= 91 && 91 <= y) && x <= 91) && 91 <= x)) || (((x <= 98 && y <= 98) && 98 <= y) && 98 <= x)) || (((x <= 95 && 95 <= x) && y <= 95) && 95 <= y)) || (((88 <= x && x <= 88) && y <= 88) && 88 <= y)) || (((x <= 39 && y <= 50) && 50 <= y) && 39 <= x)) || (((x <= 73 && 73 <= x) && y <= 73) && 73 <= y)) || (((x <= 66 && 66 <= y) && y <= 66) && 66 <= x)) || (((77 <= y && y <= 77) && x <= 77) && 77 <= x)) || (((y <= 50 && 50 <= y) && 35 <= x) && x <= 35)) || (((97 <= y && 97 <= x) && x <= 97) && y <= 97)) || (((y <= 50 && x <= 5) && 50 <= y) && 5 <= x)) || (((x <= 59 && 59 <= y) && y <= 59) && 59 <= x)) || (((85 <= x && y <= 85) && 85 <= y) && x <= 85)) || (((53 <= y && x <= 53) && 53 <= x) && y <= 53)) || (((60 <= y && 60 <= x) && x <= 60) && y <= 60)) || (((y <= 50 && 50 <= y) && 38 <= x) && x <= 38)) || (((y <= 50 && x <= 21) && 50 <= y) && 21 <= x)) || (((y <= 50 && 50 <= y) && 23 <= x) && x <= 23)) || (((y <= 50 && 50 <= y) && x <= 33) && 33 <= x)) || (((70 <= x && 70 <= y) && x <= 70) && y <= 70)) || (((64 <= x && y <= 64) && 64 <= y) && x <= 64)) || (((y <= 55 && x <= 55) && 55 <= x) && 55 <= y)) || (((y <= 81 && x <= 81) && 81 <= y) && 81 <= x)) || (((y <= 50 && 50 <= y) && 49 <= x) && x <= 49)) || (((y <= 50 && 50 <= y) && x <= 11) && 11 <= x)) || (((y <= 50 && 50 <= y) && x <= 16) && 16 <= x)) || (((92 <= y && x <= 92) && 92 <= x) && y <= 92)) || (((x <= 74 && 74 <= x) && y <= 74) && 74 <= y)) || (((y <= 50 && 50 <= y) && 7 <= x) && x <= 7)) || (((y <= 79 && 79 <= y) && 79 <= x) && x <= 79)) || (((y <= 50 && x <= 34) && 50 <= y) && 34 <= x)) || (((x <= 47 && y <= 50) && 50 <= y) && 47 <= x)) || (((x <= 94 && 94 <= y) && y <= 94) && 94 <= x)) || (((67 <= y && y <= 67) && x <= 67) && 67 <= x)) || (((56 <= x && y <= 56) && x <= 56) && 56 <= y)) || (((61 <= x && y <= 61) && 61 <= y) && x <= 61)) || (((y <= 50 && 50 <= y) && x <= 44) && 44 <= x)) || (((y <= 50 && 40 <= x) && 50 <= y) && x <= 40)) || (((y <= 50 && 50 <= y) && 45 <= x) && x <= 45)) || (((x <= 83 && y <= 83) && 83 <= x) && 83 <= y)) || (((x <= 89 && 89 <= y) && y <= 89) && 89 <= x)) || ((100 <= x && 100 <= y) && y <= 100)) || (((57 <= x && x <= 57) && y <= 57) && 57 <= y)) || (((y <= 50 && 50 <= y) && 24 <= x) && x <= 24)) || (((y <= 50 && 13 <= x) && 50 <= y) && x <= 13)) || (((86 <= x && 86 <= y) && y <= 86) && x <= 86)) || (((y <= 50 && 50 <= y) && x <= 30) && 30 <= x)) || (((y <= 50 && 50 <= y) && 6 <= x) && x <= 6)) || (((y <= 50 && 50 <= y) && x <= 29) && 29 <= x)) || (((y <= 50 && 50 <= y) && 37 <= x) && x <= 37)) || (((y <= 90 && x <= 90) && 90 <= y) && 90 <= x)) || (((82 <= x && y <= 82) && x <= 82) && 82 <= y)) || (((y <= 50 && 50 <= y) && 41 <= x) && x <= 41) - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: true - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 2 error locations. SAFE Result, 65.8s OverallTime, 103 OverallIterations, 101 TraceHistogramMax, 30.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 506 SDtfs, 152 SDslu, 10713 SDs, 0 SdLazy, 305203 SolverSat, 3749 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5455 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 22.9s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 2601/181901 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 103 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 111 NumberOfFragments, 1335 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 30.4s InterpolantComputationTime, 5562 NumberOfCodeBlocks, 5562 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 5459 ConstructedInterpolants, 0 QuantifiedInterpolants, 2408759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 103 InterpolantComputations, 1 PerfectInterpolantSequences, 2601/181901 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/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-51-34-307.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-51-34-307.csv Received shutdown request...